./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Ackermann03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Ackermann03.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/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 33d0641b9a339cc7e30dea71c1d04be4d72dcf57 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 23:51:16,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:51:16,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:51:16,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:51:16,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:51:16,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:51:16,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:51:16,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:51:16,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:51:16,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:51:16,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:51:16,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:51:16,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:51:16,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:51:16,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:51:16,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:51:16,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:51:16,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:51:16,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:51:16,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:51:16,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:51:16,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:51:16,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:51:16,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:51:16,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:51:16,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:51:16,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:51:16,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:51:16,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:51:16,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:51:16,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:51:16,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:51:16,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:51:16,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:51:16,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:51:16,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:51:16,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:51:16,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:51:16,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:51:16,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:51:16,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:51:16,851 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:51:16,867 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:51:16,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:51:16,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:51:16,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:51:16,869 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:51:16,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:51:16,870 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:51:16,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:51:16,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:51:16,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:51:16,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:51:16,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:51:16,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:51:16,871 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:51:16,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:51:16,872 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:51:16,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:51:16,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:51:16,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:51:16,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:51:16,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:51:16,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:51:16,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:51:16,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:51:16,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:51:16,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:51:16,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:51:16,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:51:16,875 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_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/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 -> 33d0641b9a339cc7e30dea71c1d04be4d72dcf57 [2019-11-19 23:51:17,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:51:17,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:51:17,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:51:17,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:51:17,087 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:51:17,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/../../sv-benchmarks/c/recursive/Ackermann03.c [2019-11-19 23:51:17,166 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/data/9af878842/d4e35cc4a2a04d0db629958a6b9f67e6/FLAGaa6f0b269 [2019-11-19 23:51:17,597 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:51:17,599 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/sv-benchmarks/c/recursive/Ackermann03.c [2019-11-19 23:51:17,610 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/data/9af878842/d4e35cc4a2a04d0db629958a6b9f67e6/FLAGaa6f0b269 [2019-11-19 23:51:17,945 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/data/9af878842/d4e35cc4a2a04d0db629958a6b9f67e6 [2019-11-19 23:51:17,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:51:17,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:51:17,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:51:17,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:51:17,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:51:17,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:51:17" (1/1) ... [2019-11-19 23:51:17,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bbcc623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:17, skipping insertion in model container [2019-11-19 23:51:17,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:51:17" (1/1) ... [2019-11-19 23:51:17,968 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:51:17,986 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:51:18,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:51:18,159 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:51:18,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:51:18,277 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:51:18,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18 WrapperNode [2019-11-19 23:51:18,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:51:18,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:51:18,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:51:18,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:51:18,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18" (1/1) ... [2019-11-19 23:51:18,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18" (1/1) ... [2019-11-19 23:51:18,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:51:18,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:51:18,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:51:18,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:51:18,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18" (1/1) ... [2019-11-19 23:51:18,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18" (1/1) ... [2019-11-19 23:51:18,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18" (1/1) ... [2019-11-19 23:51:18,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18" (1/1) ... [2019-11-19 23:51:18,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18" (1/1) ... [2019-11-19 23:51:18,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18" (1/1) ... [2019-11-19 23:51:18,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18" (1/1) ... [2019-11-19 23:51:18,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:51:18,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:51:18,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:51:18,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:51:18,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/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-19 23:51:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:51:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:51:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-11-19 23:51:18,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-11-19 23:51:18,732 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:51:18,733 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 23:51:18,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:51:18 BoogieIcfgContainer [2019-11-19 23:51:18,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:51:18,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:51:18,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:51:18,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:51:18,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:51:17" (1/3) ... [2019-11-19 23:51:18,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248532d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:51:18, skipping insertion in model container [2019-11-19 23:51:18,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:51:18" (2/3) ... [2019-11-19 23:51:18,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248532d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:51:18, skipping insertion in model container [2019-11-19 23:51:18,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:51:18" (3/3) ... [2019-11-19 23:51:18,747 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2019-11-19 23:51:18,758 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:51:18,765 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:51:18,777 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:51:18,804 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:51:18,804 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:51:18,804 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:51:18,805 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:51:18,805 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:51:18,805 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:51:18,805 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:51:18,805 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:51:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-11-19 23:51:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 23:51:18,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:18,833 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:18,834 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:18,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1260755674, now seen corresponding path program 1 times [2019-11-19 23:51:18,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:18,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371446555] [2019-11-19 23:51:18,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:19,065 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-19 23:51:19,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371446555] [2019-11-19 23:51:19,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:51:19,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:51:19,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528952754] [2019-11-19 23:51:19,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:51:19,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:19,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:51:19,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:51:19,092 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2019-11-19 23:51:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:19,259 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2019-11-19 23:51:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:51:19,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-19 23:51:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:19,270 INFO L225 Difference]: With dead ends: 50 [2019-11-19 23:51:19,270 INFO L226 Difference]: Without dead ends: 24 [2019-11-19 23:51:19,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:51:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-19 23:51:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-19 23:51:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-19 23:51:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-11-19 23:51:19,324 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2019-11-19 23:51:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:19,324 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-19 23:51:19,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:51:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-11-19 23:51:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 23:51:19,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:19,328 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:19,328 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:19,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash 963920485, now seen corresponding path program 1 times [2019-11-19 23:51:19,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:19,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953672200] [2019-11-19 23:51:19,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:51:19,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953672200] [2019-11-19 23:51:19,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600039543] [2019-11-19 23:51:19,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/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-19 23:51:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:19,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 23:51:19,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:51:19,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:19,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-11-19 23:51:19,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720218419] [2019-11-19 23:51:19,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 23:51:19,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:19,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 23:51:19,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:51:19,807 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 11 states. [2019-11-19 23:51:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:20,143 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2019-11-19 23:51:20,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:51:20,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-19 23:51:20,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:20,146 INFO L225 Difference]: With dead ends: 53 [2019-11-19 23:51:20,147 INFO L226 Difference]: Without dead ends: 29 [2019-11-19 23:51:20,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-19 23:51:20,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-19 23:51:20,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-19 23:51:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 23:51:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-19 23:51:20,164 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2019-11-19 23:51:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:20,164 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-19 23:51:20,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 23:51:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2019-11-19 23:51:20,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 23:51:20,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:20,167 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:20,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:20,373 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash 416247163, now seen corresponding path program 1 times [2019-11-19 23:51:20,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:20,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160645131] [2019-11-19 23:51:20,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 23:51:20,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160645131] [2019-11-19 23:51:20,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245520606] [2019-11-19 23:51:20,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:20,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 23:51:20,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 23:51:20,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:20,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-11-19 23:51:20,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744223823] [2019-11-19 23:51:20,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 23:51:20,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:20,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 23:51:20,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:51:20,829 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 14 states. [2019-11-19 23:51:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:21,519 INFO L93 Difference]: Finished difference Result 83 states and 166 transitions. [2019-11-19 23:51:21,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 23:51:21,520 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-19 23:51:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:21,524 INFO L225 Difference]: With dead ends: 83 [2019-11-19 23:51:21,525 INFO L226 Difference]: Without dead ends: 57 [2019-11-19 23:51:21,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-11-19 23:51:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-19 23:51:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2019-11-19 23:51:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-19 23:51:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2019-11-19 23:51:21,552 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 31 [2019-11-19 23:51:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:21,553 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2019-11-19 23:51:21,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 23:51:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2019-11-19 23:51:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 23:51:21,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:21,558 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:21,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:21,770 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:21,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:21,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1827824897, now seen corresponding path program 2 times [2019-11-19 23:51:21,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:21,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763217248] [2019-11-19 23:51:21,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-19 23:51:22,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763217248] [2019-11-19 23:51:22,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826645050] [2019-11-19 23:51:22,054 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:22,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:51:22,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:51:22,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 23:51:22,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-19 23:51:22,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:22,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-19 23:51:22,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756184215] [2019-11-19 23:51:22,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 23:51:22,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:22,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 23:51:22,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:51:22,173 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 9 states. [2019-11-19 23:51:22,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:22,362 INFO L93 Difference]: Finished difference Result 119 states and 226 transitions. [2019-11-19 23:51:22,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:51:22,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-11-19 23:51:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:22,366 INFO L225 Difference]: With dead ends: 119 [2019-11-19 23:51:22,366 INFO L226 Difference]: Without dead ends: 52 [2019-11-19 23:51:22,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:51:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-19 23:51:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-19 23:51:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-19 23:51:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2019-11-19 23:51:22,394 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 44 [2019-11-19 23:51:22,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:22,395 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-11-19 23:51:22,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 23:51:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2019-11-19 23:51:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-19 23:51:22,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:22,411 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:22,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:22,623 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1207723706, now seen corresponding path program 3 times [2019-11-19 23:51:22,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:22,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666023446] [2019-11-19 23:51:22,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-19 23:51:23,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666023446] [2019-11-19 23:51:23,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629961949] [2019-11-19 23:51:23,143 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:23,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-19 23:51:23,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:51:23,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 23:51:23,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 98 proven. 19 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-19 23:51:23,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:23,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 18 [2019-11-19 23:51:23,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032800974] [2019-11-19 23:51:23,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 23:51:23,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:23,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 23:51:23,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-11-19 23:51:23,355 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand 18 states. [2019-11-19 23:51:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:24,082 INFO L93 Difference]: Finished difference Result 118 states and 221 transitions. [2019-11-19 23:51:24,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 23:51:24,083 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-11-19 23:51:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:24,088 INFO L225 Difference]: With dead ends: 118 [2019-11-19 23:51:24,088 INFO L226 Difference]: Without dead ends: 70 [2019-11-19 23:51:24,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 23:51:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-19 23:51:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-19 23:51:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-19 23:51:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2019-11-19 23:51:24,109 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 78 [2019-11-19 23:51:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:24,109 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-11-19 23:51:24,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 23:51:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2019-11-19 23:51:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-19 23:51:24,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:24,113 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 14, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:24,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:24,318 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:24,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:24,318 INFO L82 PathProgramCache]: Analyzing trace with hash -554167378, now seen corresponding path program 4 times [2019-11-19 23:51:24,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:24,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115485855] [2019-11-19 23:51:24,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 364 proven. 420 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2019-11-19 23:51:25,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115485855] [2019-11-19 23:51:25,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920728690] [2019-11-19 23:51:25,185 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:25,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:51:25,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:51:25,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 23:51:25,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 374 proven. 140 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2019-11-19 23:51:25,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:25,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8] total 28 [2019-11-19 23:51:25,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093548888] [2019-11-19 23:51:25,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-19 23:51:25,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:25,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-19 23:51:25,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2019-11-19 23:51:25,535 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 28 states. [2019-11-19 23:51:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:29,245 INFO L93 Difference]: Finished difference Result 176 states and 446 transitions. [2019-11-19 23:51:29,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-11-19 23:51:29,246 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 157 [2019-11-19 23:51:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:29,248 INFO L225 Difference]: With dead ends: 176 [2019-11-19 23:51:29,248 INFO L226 Difference]: Without dead ends: 66 [2019-11-19 23:51:29,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1700, Invalid=7420, Unknown=0, NotChecked=0, Total=9120 [2019-11-19 23:51:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-19 23:51:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-11-19 23:51:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-19 23:51:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-11-19 23:51:29,268 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 157 [2019-11-19 23:51:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:29,269 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-11-19 23:51:29,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-19 23:51:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-11-19 23:51:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-19 23:51:29,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:29,273 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:29,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:29,477 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1646083662, now seen corresponding path program 5 times [2019-11-19 23:51:29,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:29,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337918280] [2019-11-19 23:51:29,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 240 proven. 264 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-11-19 23:51:29,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337918280] [2019-11-19 23:51:29,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788613239] [2019-11-19 23:51:29,995 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:30,076 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-19 23:51:30,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:51:30,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-19 23:51:30,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-11-19 23:51:30,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:30,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 19 [2019-11-19 23:51:30,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786324638] [2019-11-19 23:51:30,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 23:51:30,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:30,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 23:51:30,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-19 23:51:30,201 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 19 states. [2019-11-19 23:51:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:31,053 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-11-19 23:51:31,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-19 23:51:31,054 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2019-11-19 23:51:31,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:31,056 INFO L225 Difference]: With dead ends: 121 [2019-11-19 23:51:31,056 INFO L226 Difference]: Without dead ends: 76 [2019-11-19 23:51:31,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=1528, Unknown=0, NotChecked=0, Total=1892 [2019-11-19 23:51:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-19 23:51:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-11-19 23:51:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 23:51:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2019-11-19 23:51:31,069 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 130 [2019-11-19 23:51:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:31,070 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-11-19 23:51:31,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 23:51:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2019-11-19 23:51:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-19 23:51:31,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:31,073 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:31,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:31,278 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:31,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:31,278 INFO L82 PathProgramCache]: Analyzing trace with hash -437561620, now seen corresponding path program 6 times [2019-11-19 23:51:31,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:31,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131993168] [2019-11-19 23:51:31,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 446 proven. 274 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-11-19 23:51:31,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131993168] [2019-11-19 23:51:31,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009873768] [2019-11-19 23:51:31,934 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:32,059 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-11-19 23:51:32,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:51:32,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-19 23:51:32,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2019-11-19 23:51:32,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:32,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 24 [2019-11-19 23:51:32,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271895684] [2019-11-19 23:51:32,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-19 23:51:32,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:32,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-19 23:51:32,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-11-19 23:51:32,213 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 24 states. [2019-11-19 23:51:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:33,530 INFO L93 Difference]: Finished difference Result 133 states and 167 transitions. [2019-11-19 23:51:33,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-19 23:51:33,531 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 156 [2019-11-19 23:51:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:33,533 INFO L225 Difference]: With dead ends: 133 [2019-11-19 23:51:33,533 INFO L226 Difference]: Without dead ends: 89 [2019-11-19 23:51:33,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=500, Invalid=2470, Unknown=0, NotChecked=0, Total=2970 [2019-11-19 23:51:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-19 23:51:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2019-11-19 23:51:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-19 23:51:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2019-11-19 23:51:33,560 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 156 [2019-11-19 23:51:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:33,562 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2019-11-19 23:51:33,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-19 23:51:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2019-11-19 23:51:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-19 23:51:33,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:33,568 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:33,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:33,773 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1768194034, now seen corresponding path program 7 times [2019-11-19 23:51:33,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:33,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019381724] [2019-11-19 23:51:33,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 503 proven. 360 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2019-11-19 23:51:34,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019381724] [2019-11-19 23:51:34,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118690809] [2019-11-19 23:51:34,527 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:34,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-19 23:51:34,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-11-19 23:51:34,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:34,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 25 [2019-11-19 23:51:34,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754511493] [2019-11-19 23:51:34,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-19 23:51:34,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:34,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 23:51:34,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-11-19 23:51:34,783 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand 25 states. [2019-11-19 23:51:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:36,175 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2019-11-19 23:51:36,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-19 23:51:36,176 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 169 [2019-11-19 23:51:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:36,179 INFO L225 Difference]: With dead ends: 151 [2019-11-19 23:51:36,179 INFO L226 Difference]: Without dead ends: 102 [2019-11-19 23:51:36,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=619, Invalid=3041, Unknown=0, NotChecked=0, Total=3660 [2019-11-19 23:51:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-19 23:51:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 78. [2019-11-19 23:51:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-19 23:51:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2019-11-19 23:51:36,211 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 169 [2019-11-19 23:51:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:36,211 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2019-11-19 23:51:36,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-19 23:51:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2019-11-19 23:51:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-19 23:51:36,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:36,213 INFO L410 BasicCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:36,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:36,414 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:36,414 INFO L82 PathProgramCache]: Analyzing trace with hash -728546296, now seen corresponding path program 8 times [2019-11-19 23:51:36,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:36,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827599360] [2019-11-19 23:51:36,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2019-11-19 23:51:37,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827599360] [2019-11-19 23:51:37,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181207139] [2019-11-19 23:51:37,548 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:37,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:51:37,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:51:37,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-19 23:51:37,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2019-11-19 23:51:38,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:38,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 25 [2019-11-19 23:51:38,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497759288] [2019-11-19 23:51:38,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-19 23:51:38,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:38,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 23:51:38,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2019-11-19 23:51:38,043 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 25 states. [2019-11-19 23:51:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:40,086 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-11-19 23:51:40,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-19 23:51:40,087 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 182 [2019-11-19 23:51:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:40,088 INFO L225 Difference]: With dead ends: 125 [2019-11-19 23:51:40,089 INFO L226 Difference]: Without dead ends: 115 [2019-11-19 23:51:40,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 234 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=247, Invalid=2615, Unknown=0, NotChecked=0, Total=2862 [2019-11-19 23:51:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-19 23:51:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2019-11-19 23:51:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-19 23:51:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2019-11-19 23:51:40,118 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 182 [2019-11-19 23:51:40,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:40,119 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2019-11-19 23:51:40,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-19 23:51:40,119 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2019-11-19 23:51:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-19 23:51:40,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:40,123 INFO L410 BasicCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:40,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:40,327 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash -215902222, now seen corresponding path program 9 times [2019-11-19 23:51:40,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:40,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039872045] [2019-11-19 23:51:40,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 665 proven. 517 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2019-11-19 23:51:41,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039872045] [2019-11-19 23:51:41,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433435492] [2019-11-19 23:51:41,225 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:41,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-11-19 23:51:41,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:51:41,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-19 23:51:41,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2019-11-19 23:51:41,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:41,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 27 [2019-11-19 23:51:41,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243399876] [2019-11-19 23:51:41,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-19 23:51:41,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:41,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-19 23:51:41,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-11-19 23:51:41,501 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand 27 states. [2019-11-19 23:51:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:42,604 INFO L93 Difference]: Finished difference Result 206 states and 269 transitions. [2019-11-19 23:51:42,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-19 23:51:42,605 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 195 [2019-11-19 23:51:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:42,607 INFO L225 Difference]: With dead ends: 206 [2019-11-19 23:51:42,608 INFO L226 Difference]: Without dead ends: 133 [2019-11-19 23:51:42,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=439, Invalid=2213, Unknown=0, NotChecked=0, Total=2652 [2019-11-19 23:51:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-19 23:51:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2019-11-19 23:51:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-19 23:51:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2019-11-19 23:51:42,632 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 195 [2019-11-19 23:51:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:42,635 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2019-11-19 23:51:42,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-19 23:51:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2019-11-19 23:51:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-19 23:51:42,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:42,639 INFO L410 BasicCegarLoop]: trace histogram [31, 31, 17, 14, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:42,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:42,844 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:42,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1299313862, now seen corresponding path program 10 times [2019-11-19 23:51:42,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:42,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630251048] [2019-11-19 23:51:42,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 268 proven. 783 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2019-11-19 23:51:43,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630251048] [2019-11-19 23:51:43,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414462023] [2019-11-19 23:51:43,558 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:43,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:51:43,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:51:43,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-19 23:51:43,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 1340 proven. 196 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-11-19 23:51:43,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:43,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 20 [2019-11-19 23:51:43,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192872170] [2019-11-19 23:51:43,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-19 23:51:43,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:43,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-19 23:51:43,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-19 23:51:43,800 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand 20 states. [2019-11-19 23:51:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:44,498 INFO L93 Difference]: Finished difference Result 174 states and 226 transitions. [2019-11-19 23:51:44,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 23:51:44,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 208 [2019-11-19 23:51:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:44,501 INFO L225 Difference]: With dead ends: 174 [2019-11-19 23:51:44,501 INFO L226 Difference]: Without dead ends: 103 [2019-11-19 23:51:44,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2019-11-19 23:51:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-19 23:51:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2019-11-19 23:51:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-19 23:51:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2019-11-19 23:51:44,512 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 208 [2019-11-19 23:51:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:44,513 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2019-11-19 23:51:44,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-19 23:51:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2019-11-19 23:51:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-19 23:51:44,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:44,516 INFO L410 BasicCegarLoop]: trace histogram [42, 42, 23, 19, 18, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:44,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:44,720 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:44,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:44,721 INFO L82 PathProgramCache]: Analyzing trace with hash -261718049, now seen corresponding path program 11 times [2019-11-19 23:51:44,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:44,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287700721] [2019-11-19 23:51:44,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1521 proven. 761 refuted. 0 times theorem prover too weak. 2047 trivial. 0 not checked. [2019-11-19 23:51:46,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287700721] [2019-11-19 23:51:46,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250589938] [2019-11-19 23:51:46,157 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:46,368 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-11-19 23:51:46,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:51:46,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-19 23:51:46,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1483 proven. 777 refuted. 0 times theorem prover too weak. 2069 trivial. 0 not checked. [2019-11-19 23:51:46,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:46,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 34 [2019-11-19 23:51:46,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969604383] [2019-11-19 23:51:46,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-19 23:51:46,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-19 23:51:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2019-11-19 23:51:46,555 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand 34 states. [2019-11-19 23:51:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:48,582 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2019-11-19 23:51:48,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-11-19 23:51:48,583 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 280 [2019-11-19 23:51:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:48,585 INFO L225 Difference]: With dead ends: 191 [2019-11-19 23:51:48,585 INFO L226 Difference]: Without dead ends: 126 [2019-11-19 23:51:48,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1037, Invalid=5935, Unknown=0, NotChecked=0, Total=6972 [2019-11-19 23:51:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-19 23:51:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2019-11-19 23:51:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-19 23:51:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2019-11-19 23:51:48,601 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 280 [2019-11-19 23:51:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:48,602 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2019-11-19 23:51:48,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-19 23:51:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2019-11-19 23:51:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-11-19 23:51:48,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:51:48,605 INFO L410 BasicCegarLoop]: trace histogram [44, 44, 24, 20, 19, 19, 19, 19, 19, 19, 19, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:51:48,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:48,818 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:51:48,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:51:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1710761897, now seen corresponding path program 12 times [2019-11-19 23:51:48,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:51:48,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655366576] [2019-11-19 23:51:48,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:51:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:51:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 233 proven. 548 refuted. 0 times theorem prover too weak. 3983 trivial. 0 not checked. [2019-11-19 23:51:49,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655366576] [2019-11-19 23:51:49,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649197222] [2019-11-19 23:51:49,550 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:49,772 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-11-19 23:51:49,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:51:49,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 23:51:49,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:51:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 215 proven. 426 refuted. 0 times theorem prover too weak. 4123 trivial. 0 not checked. [2019-11-19 23:51:49,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:51:49,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-19 23:51:49,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354141805] [2019-11-19 23:51:49,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 23:51:49,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:51:49,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 23:51:49,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:51:49,900 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 12 states. [2019-11-19 23:51:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:51:50,074 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2019-11-19 23:51:50,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 23:51:50,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 293 [2019-11-19 23:51:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:51:50,075 INFO L225 Difference]: With dead ends: 97 [2019-11-19 23:51:50,075 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 23:51:50,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-11-19 23:51:50,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 23:51:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 23:51:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 23:51:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 23:51:50,077 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 293 [2019-11-19 23:51:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:51:50,077 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:51:50,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 23:51:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 23:51:50,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 23:51:50,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:51:50,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 23:51:51,811 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 20 [2019-11-19 23:51:53,288 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 177 DAG size of output: 70 [2019-11-19 23:51:53,407 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 9 [2019-11-19 23:51:53,463 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-11-19 23:51:53,463 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 23:51:53,463 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 23:51:53,463 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 23:51:53,463 INFO L444 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2019-11-19 23:51:53,464 INFO L447 ceAbstractionStarter]: At program point L25(lines 25 45) the Hoare annotation is: true [2019-11-19 23:51:53,464 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-11-19 23:51:53,464 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-19 23:51:53,464 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 44) no Hoare annotation was computed. [2019-11-19 23:51:53,464 INFO L447 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: true [2019-11-19 23:51:53,464 INFO L444 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2019-11-19 23:51:53,464 INFO L444 ceAbstractionStarter]: For program point ackermannEXIT(lines 14 22) no Hoare annotation was computed. [2019-11-19 23:51:53,465 INFO L447 ceAbstractionStarter]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2019-11-19 23:51:53,465 INFO L440 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= |ackermann_#in~n| 0)) (or (not (<= 0 |ackermann_#in~m|)) (not (<= 1 |ackermann_#in~n|)) (<= 1 |ackermann_#in~m|) (not (<= |ackermann_#in~n| 1)))) [2019-11-19 23:51:53,465 INFO L444 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-11-19 23:51:53,465 INFO L440 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2019-11-19 23:51:53,465 INFO L440 ceAbstractionStarter]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse9 (<= 5 |ackermann_#t~ret1|)) (.cse7 (<= 2 |ackermann_#in~m|))) (let ((.cse3 (<= 1 |ackermann_#in~m|)) (.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse12 (<= ackermann_~m 1)) (.cse15 (<= |ackermann_#in~n| 1)) (.cse16 (and .cse9 .cse7)) (.cse2 (<= 7 |ackermann_#t~ret1|)) (.cse8 (<= 3 |ackermann_#in~n|))) (let ((.cse10 (<= |ackermann_#t~ret1| 5)) (.cse4 (<= 3 |ackermann_#t~ret1|)) (.cse13 (and (and .cse16 .cse2) .cse8)) (.cse14 (<= 3 |ackermann_#in~m|)) (.cse5 (<= |ackermann_#in~n| 2)) (.cse6 (<= |ackermann_#t~ret1| 3)) (.cse11 (and .cse3 .cse0 .cse1 (<= 1 |ackermann_#in~n|) .cse12 .cse15 (<= 2 |ackermann_#t~ret1|) (<= |ackermann_#t~ret1| 2))) (.cse17 (= |ackermann_#in~m| 0))) (and (or (and .cse0 .cse1 (<= 6 |ackermann_#in~n|) .cse2) (and .cse0 (<= |ackermann_#in~n| 5) .cse1 (<= |ackermann_#t~ret1| 6) (<= 6 |ackermann_#t~ret1|) (<= 5 |ackermann_#in~n|)) (not .cse3) (and .cse4 .cse5 .cse0 .cse1 .cse6) .cse7 (and (<= 4 |ackermann_#t~ret1|) .cse0 (<= |ackermann_#in~n| 3) .cse1 .cse8 (<= |ackermann_#t~ret1| 4)) (and .cse9 .cse0 .cse1 (<= |ackermann_#in~n| 4) .cse10 (<= 4 |ackermann_#in~n|)) .cse11) (or .cse12 .cse13 .cse14 .cse15 (and .cse10 .cse16)) (or (and .cse4 .cse0 .cse1) (not .cse7)) (or (not (<= |ackermann_#in~n| 0)) .cse17) (or (not (<= |ackermann_#in~m| 0)) (and .cse0 .cse17 .cse1)) (or .cse13 .cse12 .cse14 (and (<= 2 |ackermann_#in~n|) .cse5) .cse6) (or .cse7 (not .cse15) .cse11 .cse17))))) [2019-11-19 23:51:53,465 INFO L444 ceAbstractionStarter]: For program point L18(lines 18 20) no Hoare annotation was computed. [2019-11-19 23:51:53,466 INFO L444 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-11-19 23:51:53,466 INFO L444 ceAbstractionStarter]: For program point L21-3(line 21) no Hoare annotation was computed. [2019-11-19 23:51:53,466 INFO L444 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2019-11-19 23:51:53,466 INFO L444 ceAbstractionStarter]: For program point ackermannFINAL(lines 14 22) no Hoare annotation was computed. [2019-11-19 23:51:53,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:51:53 BoogieIcfgContainer [2019-11-19 23:51:53,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:51:53,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:51:53,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:51:53,477 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:51:53,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:51:18" (3/4) ... [2019-11-19 23:51:53,493 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 23:51:53,502 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2019-11-19 23:51:53,510 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 23:51:53,511 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 23:51:53,583 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1a01baa7-c44b-40b4-9d26-b9bc84a04f7e/bin/uautomizer/witness.graphml [2019-11-19 23:51:53,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:51:53,585 INFO L168 Benchmark]: Toolchain (without parser) took 35635.05 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 626.0 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -280.2 MB). Peak memory consumption was 345.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:51:53,585 INFO L168 Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:51:53,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:51:53,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:51:53,586 INFO L168 Benchmark]: Boogie Preprocessor took 18.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:51:53,586 INFO L168 Benchmark]: RCFGBuilder took 388.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-11-19 23:51:53,587 INFO L168 Benchmark]: TraceAbstraction took 34741.02 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 514.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -152.9 MB). Peak memory consumption was 721.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:51:53,587 INFO L168 Benchmark]: Witness Printer took 106.62 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:51:53,589 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.64 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 388.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34741.02 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 514.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -152.9 MB). Peak memory consumption was 721.4 MB. Max. memory is 11.5 GB. * Witness Printer took 106.62 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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: 25]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Result: SAFE, OverallTime: 34.6s, OverallIterations: 14, TraceHistogramMax: 44, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, HoareTripleCheckerStatistics: 366 SDtfs, 572 SDslu, 2235 SDs, 0 SdLazy, 7824 SolverSat, 1470 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3112 GetRequests, 2540 SyntacticMatches, 7 SemanticMatches, 565 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7403 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 179 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 538 PreInvPairs, 1158 NumberOfFragments, 303 HoareAnnotationTreeSize, 538 FomulaSimplifications, 236418 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 20953 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 3893 NumberOfCodeBlocks, 3758 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 3866 ConstructedInterpolants, 0 QuantifiedInterpolants, 1389250 SizeOfPredicates, 111 NumberOfNonLiveVariables, 5351 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 27 InterpolantComputations, 1 PerfectInterpolantSequences, 33464/40688 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...