./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/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 9a8cb7a54337f31cc721bc63892cae8fcf685402 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:14:52,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:14:52,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:14:52,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:14:52,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:14:52,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:14:52,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:14:52,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:14:52,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:14:52,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:14:52,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:14:52,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:14:52,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:14:52,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:14:52,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:14:52,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:14:52,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:14:52,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:14:52,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:14:52,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:14:52,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:14:52,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:14:52,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:14:52,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:14:52,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:14:52,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:14:52,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:14:52,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:14:52,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:14:52,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:14:52,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:14:52,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:14:52,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:14:52,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:14:52,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:14:52,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:14:52,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:14:52,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:14:52,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:14:52,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:14:52,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:14:52,811 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:14:52,836 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:14:52,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:14:52,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:14:52,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:14:52,839 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:14:52,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:14:52,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:14:52,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:14:52,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:14:52,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:14:52,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:14:52,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:14:52,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:14:52,842 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:14:52,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:14:52,842 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:14:52,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:14:52,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:14:52,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:14:52,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:14:52,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:14:52,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:14:52,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:14:52,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:14:52,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:14:52,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:14:52,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:14:52,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:14:52,846 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_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/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 -> 9a8cb7a54337f31cc721bc63892cae8fcf685402 [2019-11-15 21:14:52,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:14:52,891 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:14:52,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:14:52,895 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:14:52,895 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:14:52,896 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2019-11-15 21:14:52,947 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/data/6367a8d82/ae9762e6ee794cf39efd938cdeb3f566/FLAG13ca876ac [2019-11-15 21:14:53,380 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:14:53,383 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2019-11-15 21:14:53,393 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/data/6367a8d82/ae9762e6ee794cf39efd938cdeb3f566/FLAG13ca876ac [2019-11-15 21:14:53,411 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/data/6367a8d82/ae9762e6ee794cf39efd938cdeb3f566 [2019-11-15 21:14:53,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:14:53,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:14:53,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:53,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:14:53,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:14:53,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:53" (1/1) ... [2019-11-15 21:14:53,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c8ea24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53, skipping insertion in model container [2019-11-15 21:14:53,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:53" (1/1) ... [2019-11-15 21:14:53,430 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:14:53,473 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:14:53,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:53,711 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:14:53,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:53,770 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:14:53,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53 WrapperNode [2019-11-15 21:14:53,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:53,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:14:53,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:14:53,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:14:53,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53" (1/1) ... [2019-11-15 21:14:53,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53" (1/1) ... [2019-11-15 21:14:53,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:14:53,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:14:53,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:14:53,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:14:53,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53" (1/1) ... [2019-11-15 21:14:53,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53" (1/1) ... [2019-11-15 21:14:53,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53" (1/1) ... [2019-11-15 21:14:53,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53" (1/1) ... [2019-11-15 21:14:53,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53" (1/1) ... [2019-11-15 21:14:53,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53" (1/1) ... [2019-11-15 21:14:53,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53" (1/1) ... [2019-11-15 21:14:53,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:14:53,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:14:53,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:14:53,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:14:53,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:14:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:14:53,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:14:54,300 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:14:54,301 INFO L284 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-15 21:14:54,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:54 BoogieIcfgContainer [2019-11-15 21:14:54,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:14:54,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:14:54,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:14:54,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:14:54,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:14:53" (1/3) ... [2019-11-15 21:14:54,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2054ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:14:54, skipping insertion in model container [2019-11-15 21:14:54,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:53" (2/3) ... [2019-11-15 21:14:54,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2054ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:14:54, skipping insertion in model container [2019-11-15 21:14:54,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:54" (3/3) ... [2019-11-15 21:14:54,309 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2019-11-15 21:14:54,318 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:14:54,327 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:14:54,334 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:14:54,352 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:14:54,352 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:14:54,352 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:14:54,352 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:14:54,353 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:14:54,353 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:14:54,353 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:14:54,353 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:14:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-15 21:14:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:14:54,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:54,375 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:54,377 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:54,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:54,382 INFO L82 PathProgramCache]: Analyzing trace with hash -991589482, now seen corresponding path program 1 times [2019-11-15 21:14:54,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:54,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445144309] [2019-11-15 21:14:54,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:54,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:54,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:54,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445144309] [2019-11-15 21:14:54,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:54,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:54,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992103856] [2019-11-15 21:14:54,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:14:54,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:54,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:14:54,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:54,576 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-11-15 21:14:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:54,623 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2019-11-15 21:14:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:14:54,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 21:14:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:54,635 INFO L225 Difference]: With dead ends: 149 [2019-11-15 21:14:54,636 INFO L226 Difference]: Without dead ends: 67 [2019-11-15 21:14:54,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-15 21:14:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-15 21:14:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-15 21:14:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2019-11-15 21:14:54,673 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 24 [2019-11-15 21:14:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:54,674 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2019-11-15 21:14:54,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:14:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2019-11-15 21:14:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:14:54,675 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:54,675 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:54,676 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1791855548, now seen corresponding path program 1 times [2019-11-15 21:14:54,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:54,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58861229] [2019-11-15 21:14:54,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:54,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:54,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:54,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58861229] [2019-11-15 21:14:54,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:54,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:54,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276792571] [2019-11-15 21:14:54,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:54,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:54,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:54,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:54,766 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 4 states. [2019-11-15 21:14:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:54,806 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2019-11-15 21:14:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:54,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-15 21:14:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:54,809 INFO L225 Difference]: With dead ends: 87 [2019-11-15 21:14:54,809 INFO L226 Difference]: Without dead ends: 67 [2019-11-15 21:14:54,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:14:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-15 21:14:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-15 21:14:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-15 21:14:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2019-11-15 21:14:54,830 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 26 [2019-11-15 21:14:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:54,831 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2019-11-15 21:14:54,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2019-11-15 21:14:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:14:54,833 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:54,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:54,834 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2050020986, now seen corresponding path program 1 times [2019-11-15 21:14:54,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:54,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654178241] [2019-11-15 21:14:54,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:54,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:54,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:54,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654178241] [2019-11-15 21:14:54,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:54,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:54,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307766694] [2019-11-15 21:14:54,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:14:54,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:54,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:14:54,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:54,930 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand 3 states. [2019-11-15 21:14:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:55,042 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2019-11-15 21:14:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:14:55,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 21:14:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:55,043 INFO L225 Difference]: With dead ends: 121 [2019-11-15 21:14:55,044 INFO L226 Difference]: Without dead ends: 75 [2019-11-15 21:14:55,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-15 21:14:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2019-11-15 21:14:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-15 21:14:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2019-11-15 21:14:55,058 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 26 [2019-11-15 21:14:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:55,059 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2019-11-15 21:14:55,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:14:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2019-11-15 21:14:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 21:14:55,063 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:55,063 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:55,063 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:55,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:55,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1329816874, now seen corresponding path program 1 times [2019-11-15 21:14:55,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:55,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946906129] [2019-11-15 21:14:55,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:55,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:55,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:55,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946906129] [2019-11-15 21:14:55,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:55,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:55,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377505798] [2019-11-15 21:14:55,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:55,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:55,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:55,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:55,109 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand 4 states. [2019-11-15 21:14:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:55,211 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2019-11-15 21:14:55,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:55,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-15 21:14:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:55,213 INFO L225 Difference]: With dead ends: 155 [2019-11-15 21:14:55,213 INFO L226 Difference]: Without dead ends: 90 [2019-11-15 21:14:55,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:14:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-15 21:14:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-11-15 21:14:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 21:14:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2019-11-15 21:14:55,221 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 29 [2019-11-15 21:14:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:55,221 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2019-11-15 21:14:55,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2019-11-15 21:14:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:14:55,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:55,223 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:55,223 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:55,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:55,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1760271131, now seen corresponding path program 1 times [2019-11-15 21:14:55,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:55,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543844465] [2019-11-15 21:14:55,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:55,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:55,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:55,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543844465] [2019-11-15 21:14:55,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:55,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:14:55,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599562533] [2019-11-15 21:14:55,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:14:55,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:55,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:14:55,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:55,290 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand 3 states. [2019-11-15 21:14:55,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:55,341 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2019-11-15 21:14:55,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:14:55,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-15 21:14:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:55,343 INFO L225 Difference]: With dead ends: 108 [2019-11-15 21:14:55,343 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 21:14:55,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:14:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 21:14:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-15 21:14:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 21:14:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2019-11-15 21:14:55,349 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 30 [2019-11-15 21:14:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:55,350 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2019-11-15 21:14:55,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:14:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2019-11-15 21:14:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:14:55,351 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:55,351 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:55,351 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:55,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:55,352 INFO L82 PathProgramCache]: Analyzing trace with hash -171839511, now seen corresponding path program 1 times [2019-11-15 21:14:55,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:55,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583775564] [2019-11-15 21:14:55,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:55,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:55,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:55,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583775564] [2019-11-15 21:14:55,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:55,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:55,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546214187] [2019-11-15 21:14:55,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:14:55,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:55,425 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand 4 states. [2019-11-15 21:14:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:55,499 INFO L93 Difference]: Finished difference Result 110 states and 154 transitions. [2019-11-15 21:14:55,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:55,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-15 21:14:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:55,500 INFO L225 Difference]: With dead ends: 110 [2019-11-15 21:14:55,501 INFO L226 Difference]: Without dead ends: 63 [2019-11-15 21:14:55,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-15 21:14:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-11-15 21:14:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-15 21:14:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2019-11-15 21:14:55,506 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 31 [2019-11-15 21:14:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:55,506 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2019-11-15 21:14:55,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:14:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2019-11-15 21:14:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:14:55,508 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:55,508 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:55,508 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:55,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2115361752, now seen corresponding path program 1 times [2019-11-15 21:14:55,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:55,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417974302] [2019-11-15 21:14:55,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:55,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:55,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:55,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417974302] [2019-11-15 21:14:55,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080940260] [2019-11-15 21:14:55,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:14:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:55,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:14:55,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:55,684 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:14:55,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-15 21:14:55,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828543745] [2019-11-15 21:14:55,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:14:55,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:55,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:14:55,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:14:55,686 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 5 states. [2019-11-15 21:14:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:55,786 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2019-11-15 21:14:55,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:14:55,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-15 21:14:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:55,789 INFO L225 Difference]: With dead ends: 133 [2019-11-15 21:14:55,789 INFO L226 Difference]: Without dead ends: 87 [2019-11-15 21:14:55,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:14:55,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-15 21:14:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2019-11-15 21:14:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 21:14:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2019-11-15 21:14:55,797 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 32 [2019-11-15 21:14:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:55,799 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2019-11-15 21:14:55,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:14:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2019-11-15 21:14:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:14:55,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:55,803 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:56,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:14:56,008 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash 431286119, now seen corresponding path program 1 times [2019-11-15 21:14:56,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:56,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114869017] [2019-11-15 21:14:56,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:56,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:56,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:56,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114869017] [2019-11-15 21:14:56,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581380386] [2019-11-15 21:14:56,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/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-15 21:14:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:56,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:14:56,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:14:56,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:14:56,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-11-15 21:14:56,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231732303] [2019-11-15 21:14:56,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:14:56,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:14:56,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:14:56,209 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand 6 states. [2019-11-15 21:14:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:56,378 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-11-15 21:14:56,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:14:56,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-15 21:14:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:56,380 INFO L225 Difference]: With dead ends: 93 [2019-11-15 21:14:56,380 INFO L226 Difference]: Without dead ends: 89 [2019-11-15 21:14:56,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:14:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-15 21:14:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-11-15 21:14:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 21:14:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2019-11-15 21:14:56,390 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 34 [2019-11-15 21:14:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:56,390 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-11-15 21:14:56,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:14:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2019-11-15 21:14:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:14:56,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:56,397 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:56,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:14:56,602 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:56,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2094293407, now seen corresponding path program 1 times [2019-11-15 21:14:56,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:56,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066607331] [2019-11-15 21:14:56,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:56,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:56,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:56,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066607331] [2019-11-15 21:14:56,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679632762] [2019-11-15 21:14:56,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/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-15 21:14:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:56,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:14:56,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:14:56,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:14:56,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-11-15 21:14:56,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005964516] [2019-11-15 21:14:56,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:14:56,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:56,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:14:56,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:14:56,844 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 6 states. [2019-11-15 21:14:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:56,951 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-11-15 21:14:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:14:56,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-15 21:14:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:56,952 INFO L225 Difference]: With dead ends: 76 [2019-11-15 21:14:56,953 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 21:14:56,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:14:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 21:14:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2019-11-15 21:14:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 21:14:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-11-15 21:14:56,962 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 36 [2019-11-15 21:14:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:56,967 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-11-15 21:14:56,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:14:56,967 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-11-15 21:14:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:14:56,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:56,968 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:57,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:14:57,172 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:57,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2092446365, now seen corresponding path program 1 times [2019-11-15 21:14:57,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:57,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411047263] [2019-11-15 21:14:57,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:57,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:57,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:14:57,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411047263] [2019-11-15 21:14:57,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:57,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:14:57,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729848929] [2019-11-15 21:14:57,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:14:57,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:57,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:14:57,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:14:57,244 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 6 states. [2019-11-15 21:14:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:57,318 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2019-11-15 21:14:57,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:14:57,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-15 21:14:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:57,319 INFO L225 Difference]: With dead ends: 71 [2019-11-15 21:14:57,319 INFO L226 Difference]: Without dead ends: 61 [2019-11-15 21:14:57,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:14:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-15 21:14:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-15 21:14:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 21:14:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2019-11-15 21:14:57,323 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 36 [2019-11-15 21:14:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:57,323 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2019-11-15 21:14:57,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:14:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2019-11-15 21:14:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 21:14:57,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:57,324 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:57,324 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash -828854686, now seen corresponding path program 1 times [2019-11-15 21:14:57,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:57,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785735203] [2019-11-15 21:14:57,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:57,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:57,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:57,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785735203] [2019-11-15 21:14:57,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929455610] [2019-11-15 21:14:57,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/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-15 21:14:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:57,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:14:57,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:14:57,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:14:57,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-11-15 21:14:57,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686746077] [2019-11-15 21:14:57,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:14:57,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:57,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:14:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:14:57,543 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand 7 states. [2019-11-15 21:14:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:57,723 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2019-11-15 21:14:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:14:57,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-15 21:14:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:57,724 INFO L225 Difference]: With dead ends: 90 [2019-11-15 21:14:57,724 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 21:14:57,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:14:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 21:14:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-11-15 21:14:57,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 21:14:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-11-15 21:14:57,737 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 37 [2019-11-15 21:14:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:57,737 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-11-15 21:14:57,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:14:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2019-11-15 21:14:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 21:14:57,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:57,738 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:57,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:14:57,941 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:57,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:57,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1188671725, now seen corresponding path program 1 times [2019-11-15 21:14:57,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:57,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339921916] [2019-11-15 21:14:57,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:57,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:57,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:58,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339921916] [2019-11-15 21:14:58,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69238308] [2019-11-15 21:14:58,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/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-15 21:14:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:58,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:14:58,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:14:58,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:14:58,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-11-15 21:14:58,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338483691] [2019-11-15 21:14:58,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:14:58,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:58,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:14:58,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:14:58,166 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 8 states. [2019-11-15 21:14:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:58,376 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2019-11-15 21:14:58,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:14:58,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-15 21:14:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:58,377 INFO L225 Difference]: With dead ends: 99 [2019-11-15 21:14:58,377 INFO L226 Difference]: Without dead ends: 63 [2019-11-15 21:14:58,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:14:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-15 21:14:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-11-15 21:14:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 21:14:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-11-15 21:14:58,381 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 41 [2019-11-15 21:14:58,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:58,383 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-11-15 21:14:58,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:14:58,383 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-11-15 21:14:58,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 21:14:58,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:14:58,384 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:58,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:14:58,592 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:14:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1115909698, now seen corresponding path program 1 times [2019-11-15 21:14:58,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:58,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843884784] [2019-11-15 21:14:58,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:58,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:58,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:58,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843884784] [2019-11-15 21:14:58,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647461141] [2019-11-15 21:14:58,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/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-15 21:14:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:58,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 21:14:58,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:14:58,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:14:58,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2019-11-15 21:14:58,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835547536] [2019-11-15 21:14:58,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:14:58,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:58,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:14:58,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:14:58,842 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2019-11-15 21:14:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:59,066 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2019-11-15 21:14:59,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:14:59,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-11-15 21:14:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:14:59,067 INFO L225 Difference]: With dead ends: 64 [2019-11-15 21:14:59,067 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:14:59,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:14:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:14:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:14:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:14:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:14:59,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-15 21:14:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:14:59,069 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:14:59,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:14:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:14:59,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:14:59,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:14:59,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:14:59,408 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-11-15 21:14:59,408 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2019-11-15 21:14:59,408 INFO L443 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2019-11-15 21:14:59,408 INFO L443 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2019-11-15 21:14:59,408 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2019-11-15 21:14:59,408 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2019-11-15 21:14:59,409 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 24) no Hoare annotation was computed. [2019-11-15 21:14:59,409 INFO L443 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2019-11-15 21:14:59,409 INFO L439 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (and (= 0 ULTIMATE.start_base2flt_~m) (<= 0 ULTIMATE.start_base2flt_~e) (= ULTIMATE.start_base2flt_~__retres4~0 0)) [2019-11-15 21:14:59,409 INFO L439 ceAbstractionStarter]: At program point L69-1(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,409 INFO L439 ceAbstractionStarter]: At program point L69-2(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,409 INFO L439 ceAbstractionStarter]: At program point L69-3(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,409 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:14:59,409 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2019-11-15 21:14:59,409 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2019-11-15 21:14:59,410 INFO L439 ceAbstractionStarter]: At program point L70(lines 14 72) the Hoare annotation is: (and (= 0 |ULTIMATE.start_base2flt_#res|) (= 0 ULTIMATE.start_base2flt_~m) (<= 0 ULTIMATE.start_base2flt_~e) (= ULTIMATE.start_base2flt_~__retres4~0 0)) [2019-11-15 21:14:59,410 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-15 21:14:59,410 INFO L439 ceAbstractionStarter]: At program point L70-1(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,410 INFO L439 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: false [2019-11-15 21:14:59,410 INFO L439 ceAbstractionStarter]: At program point L70-2(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,410 INFO L443 ceAbstractionStarter]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2019-11-15 21:14:59,410 INFO L439 ceAbstractionStarter]: At program point L70-3(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,410 INFO L439 ceAbstractionStarter]: At program point L37-3(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,410 INFO L443 ceAbstractionStarter]: For program point L37-4(lines 37 41) no Hoare annotation was computed. [2019-11-15 21:14:59,410 INFO L439 ceAbstractionStarter]: At program point L37-5(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,411 INFO L443 ceAbstractionStarter]: For program point L37-6(lines 37 41) no Hoare annotation was computed. [2019-11-15 21:14:59,411 INFO L439 ceAbstractionStarter]: At program point L37-7(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,411 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2019-11-15 21:14:59,411 INFO L443 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2019-11-15 21:14:59,411 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-11-15 21:14:59,411 INFO L443 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2019-11-15 21:14:59,411 INFO L439 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~tmp~2) (<= 1 ULTIMATE.start_main_~sa~0)) (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 ULTIMATE.start_main_~zero~0)) (<= (+ ULTIMATE.start_main_~sa~0 1) 0)) [2019-11-15 21:14:59,411 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:14:59,411 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2019-11-15 21:14:59,411 INFO L443 ceAbstractionStarter]: For program point L25-1(lines 25 65) no Hoare annotation was computed. [2019-11-15 21:14:59,411 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 65) no Hoare annotation was computed. [2019-11-15 21:14:59,412 INFO L443 ceAbstractionStarter]: For program point L25-3(lines 25 65) no Hoare annotation was computed. [2019-11-15 21:14:59,412 INFO L439 ceAbstractionStarter]: At program point L207(lines 137 209) the Hoare annotation is: (or (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 |ULTIMATE.start_mulflt_#res|) (= 0 ULTIMATE.start_main_~zero~0)) (and (<= 1 ULTIMATE.start_main_~tmp~2) (<= 1 ULTIMATE.start_main_~sa~0)) (<= (+ ULTIMATE.start_main_~sa~0 1) 0)) [2019-11-15 21:14:59,412 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2019-11-15 21:14:59,412 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2019-11-15 21:14:59,412 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:14:59,412 INFO L443 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2019-11-15 21:14:59,412 INFO L443 ceAbstractionStarter]: For program point L28-1(lines 27 42) no Hoare annotation was computed. [2019-11-15 21:14:59,412 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 27 42) no Hoare annotation was computed. [2019-11-15 21:14:59,412 INFO L443 ceAbstractionStarter]: For program point L28-3(lines 27 42) no Hoare annotation was computed. [2019-11-15 21:14:59,412 INFO L439 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: false [2019-11-15 21:14:59,413 INFO L439 ceAbstractionStarter]: At program point L63-1(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,413 INFO L439 ceAbstractionStarter]: At program point L63-2(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,413 INFO L439 ceAbstractionStarter]: At program point L63-3(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,413 INFO L439 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: false [2019-11-15 21:14:59,413 INFO L439 ceAbstractionStarter]: At program point L47-5(lines 47 62) the Hoare annotation is: false [2019-11-15 21:14:59,413 INFO L439 ceAbstractionStarter]: At program point L47-8(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,413 INFO L439 ceAbstractionStarter]: At program point L47-11(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 21:14:59,416 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-11-15 21:14:59,416 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2019-11-15 21:14:59,416 INFO L446 ceAbstractionStarter]: At program point L246-1(lines 246 262) the Hoare annotation is: true [2019-11-15 21:14:59,416 INFO L443 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2019-11-15 21:14:59,417 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 47 62) no Hoare annotation was computed. [2019-11-15 21:14:59,417 INFO L443 ceAbstractionStarter]: For program point L48-2(lines 47 62) no Hoare annotation was computed. [2019-11-15 21:14:59,417 INFO L443 ceAbstractionStarter]: For program point L48-3(lines 47 62) no Hoare annotation was computed. [2019-11-15 21:14:59,417 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2019-11-15 21:14:59,417 INFO L443 ceAbstractionStarter]: For program point L247-2(lines 247 256) no Hoare annotation was computed. [2019-11-15 21:14:59,417 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2019-11-15 21:14:59,418 INFO L443 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2019-11-15 21:14:59,418 INFO L443 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2019-11-15 21:14:59,418 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 47 62) no Hoare annotation was computed. [2019-11-15 21:14:59,418 INFO L443 ceAbstractionStarter]: For program point L49-2(lines 47 62) no Hoare annotation was computed. [2019-11-15 21:14:59,418 INFO L443 ceAbstractionStarter]: For program point L49-3(lines 47 62) no Hoare annotation was computed. [2019-11-15 21:14:59,418 INFO L446 ceAbstractionStarter]: At program point L264(lines 210 266) the Hoare annotation is: true [2019-11-15 21:14:59,418 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2019-11-15 21:14:59,419 INFO L443 ceAbstractionStarter]: For program point L233-2(lines 233 242) no Hoare annotation was computed. [2019-11-15 21:14:59,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:14:59 BoogieIcfgContainer [2019-11-15 21:14:59,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:14:59,438 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:14:59,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:14:59,438 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:14:59,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:54" (3/4) ... [2019-11-15 21:14:59,442 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:14:59,454 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-15 21:14:59,455 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-15 21:14:59,479 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == \result && 0 == m) && 0 <= e) && __retres4 == 0 [2019-11-15 21:14:59,482 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sa)) || sa + 1 <= 0 [2019-11-15 21:14:59,533 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_117f7c4a-6112-4517-875e-bfb3d2bc6dc4/bin/uautomizer/witness.graphml [2019-11-15 21:14:59,533 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:14:59,545 INFO L168 Benchmark]: Toolchain (without parser) took 6130.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 947.5 MB in the beginning and 1.2 GB in the end (delta: -215.7 MB). Peak memory consumption was 219.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:59,545 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:14:59,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 947.5 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:59,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:14:59,547 INFO L168 Benchmark]: Boogie Preprocessor took 30.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:14:59,547 INFO L168 Benchmark]: RCFGBuilder took 460.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:59,547 INFO L168 Benchmark]: TraceAbstraction took 5133.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.2 MB in the end (delta: 220.6 MB). Peak memory consumption was 220.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:59,547 INFO L168 Benchmark]: Witness Printer took 105.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 38.8 MB). Free memory was 860.2 MB in the beginning and 1.2 GB in the end (delta: -303.0 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:59,549 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.43 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 947.5 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 460.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5133.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 860.2 MB in the end (delta: 220.6 MB). Peak memory consumption was 220.6 MB. Max. memory is 11.5 GB. * Witness Printer took 105.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 38.8 MB). Free memory was 860.2 MB in the beginning and 1.2 GB in the end (delta: -303.0 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: 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: 137]: Loop Invariant Derived loop invariant: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sa)) || sa + 1 <= 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (0 == m && 0 <= e) && __retres4 == 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((0 == \result && 0 == m) && 0 <= e) && __retres4 == 0 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((1 <= tmp && 1 <= sa) || (0 == __retres10 && 0 == zero)) || sa + 1 <= 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 1 error locations. Result: SAFE, OverallTime: 5.0s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 1046 SDtfs, 383 SDslu, 2280 SDs, 0 SdLazy, 784 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 106 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 63 NumberOfFragments, 114 HoareAnnotationTreeSize, 24 FomulaSimplifications, 590 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 652 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 633 ConstructedInterpolants, 1 QuantifiedInterpolants, 44266 SizeOfPredicates, 35 NumberOfNonLiveVariables, 789 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 18/37 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...