./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb528549fa76ae8087cf7043645dfa20323a0116 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:25:26,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:25:26,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:25:26,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:25:26,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:25:26,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:25:26,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:25:26,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:25:26,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:25:26,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:25:26,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:25:26,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:25:26,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:25:26,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:25:26,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:25:26,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:25:26,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:25:26,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:25:26,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:25:26,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:25:26,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:25:26,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:25:26,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:25:26,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:25:26,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:25:26,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:25:26,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:25:26,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:25:26,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:25:26,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:25:26,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:25:26,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:25:26,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:25:26,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:25:26,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:25:26,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:25:26,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:25:26,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:25:26,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:25:26,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:25:26,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:25:26,685 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-12-07 14:25:26,694 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:25:26,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:25:26,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:25:26,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:25:26,695 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:25:26,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:25:26,696 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:25:26,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:25:26,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:25:26,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:25:26,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:25:26,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:25:26,696 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 14:25:26,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:25:26,697 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:25:26,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:25:26,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:25:26,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:25:26,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:25:26,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:25:26,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:25:26,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:25:26,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:25:26,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:25:26,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:25:26,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:25:26,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:25:26,698 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:25:26,698 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_cdbd23cc-d498-447b-adac-dd91cb805dfa/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb528549fa76ae8087cf7043645dfa20323a0116 [2019-12-07 14:25:26,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:25:26,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:25:26,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:25:26,810 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:25:26,810 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:25:26,810 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-12-07 14:25:26,846 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer/data/a9f23347c/358af6efef5e4128b3abf0b36f01a351/FLAG3afa65669 [2019-12-07 14:25:27,285 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:25:27,285 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-12-07 14:25:27,289 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer/data/a9f23347c/358af6efef5e4128b3abf0b36f01a351/FLAG3afa65669 [2019-12-07 14:25:27,298 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer/data/a9f23347c/358af6efef5e4128b3abf0b36f01a351 [2019-12-07 14:25:27,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:25:27,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:25:27,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:25:27,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:25:27,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:25:27,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:25:27" (1/1) ... [2019-12-07 14:25:27,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d852d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27, skipping insertion in model container [2019-12-07 14:25:27,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:25:27" (1/1) ... [2019-12-07 14:25:27,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:25:27,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:25:27,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:25:27,448 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:25:27,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:25:27,469 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:25:27,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27 WrapperNode [2019-12-07 14:25:27,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:25:27,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:25:27,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:25:27,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:25:27,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27" (1/1) ... [2019-12-07 14:25:27,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27" (1/1) ... [2019-12-07 14:25:27,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:25:27,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:25:27,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:25:27,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:25:27,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27" (1/1) ... [2019-12-07 14:25:27,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27" (1/1) ... [2019-12-07 14:25:27,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27" (1/1) ... [2019-12-07 14:25:27,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27" (1/1) ... [2019-12-07 14:25:27,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27" (1/1) ... [2019-12-07 14:25:27,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27" (1/1) ... [2019-12-07 14:25:27,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27" (1/1) ... [2019-12-07 14:25:27,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:25:27,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:25:27,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:25:27,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:25:27,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/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-12-07 14:25:27,545 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-12-07 14:25:27,546 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-12-07 14:25:27,546 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-12-07 14:25:27,546 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-12-07 14:25:27,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:25:27,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:25:27,662 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:25:27,662 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 14:25:27,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:25:27 BoogieIcfgContainer [2019-12-07 14:25:27,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:25:27,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:25:27,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:25:27,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:25:27,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:25:27" (1/3) ... [2019-12-07 14:25:27,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc0fd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:25:27, skipping insertion in model container [2019-12-07 14:25:27,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:27" (2/3) ... [2019-12-07 14:25:27,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc0fd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:25:27, skipping insertion in model container [2019-12-07 14:25:27,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:25:27" (3/3) ... [2019-12-07 14:25:27,668 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2019-12-07 14:25:27,674 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:25:27,679 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-12-07 14:25:27,686 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-07 14:25:27,701 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:25:27,701 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:25:27,701 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:25:27,701 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:25:27,701 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:25:27,701 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:25:27,702 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:25:27,702 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:25:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-07 14:25:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:25:27,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:27,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:25:27,718 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:27,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash 70122184, now seen corresponding path program 1 times [2019-12-07 14:25:27,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:27,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046484365] [2019-12-07 14:25:27,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:25:27,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046484365] [2019-12-07 14:25:27,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:27,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:25:27,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497691059] [2019-12-07 14:25:27,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:25:27,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:27,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:25:27,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:25:27,838 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2019-12-07 14:25:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:27,907 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-12-07 14:25:27,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:27,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-12-07 14:25:27,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:27,917 INFO L225 Difference]: With dead ends: 62 [2019-12-07 14:25:27,917 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 14:25:27,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:27,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 14:25:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-12-07 14:25:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 14:25:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-12-07 14:25:27,951 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-12-07 14:25:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:27,951 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-12-07 14:25:27,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:25:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-12-07 14:25:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 14:25:27,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:27,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 14:25:27,952 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:27,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:27,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179530, now seen corresponding path program 1 times [2019-12-07 14:25:27,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:27,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747222700] [2019-12-07 14:25:27,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:25:27,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747222700] [2019-12-07 14:25:27,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:27,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:25:27,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403373716] [2019-12-07 14:25:27,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:27,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:27,968 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-12-07 14:25:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:27,981 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-12-07 14:25:27,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:27,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 14:25:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:27,982 INFO L225 Difference]: With dead ends: 52 [2019-12-07 14:25:27,982 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 14:25:27,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 14:25:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-12-07 14:25:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 14:25:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-12-07 14:25:27,991 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 6 [2019-12-07 14:25:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:27,991 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-12-07 14:25:27,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-12-07 14:25:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:25:27,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:27,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:27,992 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2074588191, now seen corresponding path program 1 times [2019-12-07 14:25:27,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:27,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34215605] [2019-12-07 14:25:27,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:25:28,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34215605] [2019-12-07 14:25:28,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:25:28,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36632126] [2019-12-07 14:25:28,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:25:28,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:25:28,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:25:28,034 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 7 states. [2019-12-07 14:25:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,120 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-12-07 14:25:28,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:25:28,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 14:25:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,121 INFO L225 Difference]: With dead ends: 77 [2019-12-07 14:25:28,121 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 14:25:28,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:25:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 14:25:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-12-07 14:25:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 14:25:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-12-07 14:25:28,132 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 10 [2019-12-07 14:25:28,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,132 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-12-07 14:25:28,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:25:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-12-07 14:25:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:25:28,132 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,132 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,133 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,133 INFO L82 PathProgramCache]: Analyzing trace with hash 112275557, now seen corresponding path program 1 times [2019-12-07 14:25:28,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866833758] [2019-12-07 14:25:28,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:25:28,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866833758] [2019-12-07 14:25:28,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:25:28,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979900908] [2019-12-07 14:25:28,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:28,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:28,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:28,148 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 3 states. [2019-12-07 14:25:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,157 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2019-12-07 14:25:28,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:28,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 14:25:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,159 INFO L225 Difference]: With dead ends: 69 [2019-12-07 14:25:28,159 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 14:25:28,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 14:25:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-12-07 14:25:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 14:25:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-12-07 14:25:28,167 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 11 [2019-12-07 14:25:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,168 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-12-07 14:25:28,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-12-07 14:25:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:25:28,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,168 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,169 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2048531074, now seen corresponding path program 1 times [2019-12-07 14:25:28,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092069994] [2019-12-07 14:25:28,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:25:28,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092069994] [2019-12-07 14:25:28,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:25:28,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509904079] [2019-12-07 14:25:28,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:28,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:28,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:28,204 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 6 states. [2019-12-07 14:25:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,232 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2019-12-07 14:25:28,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:25:28,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 14:25:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,234 INFO L225 Difference]: With dead ends: 125 [2019-12-07 14:25:28,234 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 14:25:28,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:25:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 14:25:28,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-12-07 14:25:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 14:25:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-12-07 14:25:28,245 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 16 [2019-12-07 14:25:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,245 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-12-07 14:25:28,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-12-07 14:25:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:25:28,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,246 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,246 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,247 INFO L82 PathProgramCache]: Analyzing trace with hash -57180086, now seen corresponding path program 1 times [2019-12-07 14:25:28,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201124161] [2019-12-07 14:25:28,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:25:28,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201124161] [2019-12-07 14:25:28,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:25:28,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568866093] [2019-12-07 14:25:28,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:28,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:28,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:28,264 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 3 states. [2019-12-07 14:25:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,272 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2019-12-07 14:25:28,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:28,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 14:25:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,273 INFO L225 Difference]: With dead ends: 76 [2019-12-07 14:25:28,274 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 14:25:28,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12-07 14:25:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 14:25:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-12-07 14:25:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 14:25:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2019-12-07 14:25:28,282 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 18 [2019-12-07 14:25:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,283 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2019-12-07 14:25:28,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2019-12-07 14:25:28,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:25:28,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,283 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,284 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,284 INFO L82 PathProgramCache]: Analyzing trace with hash -599425808, now seen corresponding path program 1 times [2019-12-07 14:25:28,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611210979] [2019-12-07 14:25:28,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:25:28,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611210979] [2019-12-07 14:25:28,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:25:28,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265089929] [2019-12-07 14:25:28,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:28,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:28,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:28,301 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand 3 states. [2019-12-07 14:25:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,308 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2019-12-07 14:25:28,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:28,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 14:25:28,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,310 INFO L225 Difference]: With dead ends: 75 [2019-12-07 14:25:28,310 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 14:25:28,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-12-07 14:25:28,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 14:25:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 14:25:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 14:25:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-12-07 14:25:28,318 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 19 [2019-12-07 14:25:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,318 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-12-07 14:25:28,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-12-07 14:25:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:25:28,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,319 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,319 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1772582622, now seen corresponding path program 1 times [2019-12-07 14:25:28,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722639589] [2019-12-07 14:25:28,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:25:28,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722639589] [2019-12-07 14:25:28,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:25:28,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493479251] [2019-12-07 14:25:28,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:25:28,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:25:28,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:25:28,340 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 4 states. [2019-12-07 14:25:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,354 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2019-12-07 14:25:28,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:25:28,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 14:25:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,355 INFO L225 Difference]: With dead ends: 95 [2019-12-07 14:25:28,356 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 14:25:28,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:25:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 14:25:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2019-12-07 14:25:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 14:25:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-12-07 14:25:28,367 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 19 [2019-12-07 14:25:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,368 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-12-07 14:25:28,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:25:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-12-07 14:25:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:25:28,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,369 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,369 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1402330794, now seen corresponding path program 1 times [2019-12-07 14:25:28,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846148006] [2019-12-07 14:25:28,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:25:28,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846148006] [2019-12-07 14:25:28,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:25:28,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493979077] [2019-12-07 14:25:28,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:25:28,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:25:28,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:25:28,397 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 4 states. [2019-12-07 14:25:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,410 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-12-07 14:25:28,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:25:28,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 14:25:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,411 INFO L225 Difference]: With dead ends: 89 [2019-12-07 14:25:28,412 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 14:25:28,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:25:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 14:25:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-12-07 14:25:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 14:25:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-12-07 14:25:28,421 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 20 [2019-12-07 14:25:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,421 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-12-07 14:25:28,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:25:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-12-07 14:25:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 14:25:28,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,422 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,422 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,422 INFO L82 PathProgramCache]: Analyzing trace with hash 921726737, now seen corresponding path program 1 times [2019-12-07 14:25:28,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343116127] [2019-12-07 14:25:28,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:25:28,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343116127] [2019-12-07 14:25:28,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:25:28,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431836048] [2019-12-07 14:25:28,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:28,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:28,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:28,459 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 6 states. [2019-12-07 14:25:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,502 INFO L93 Difference]: Finished difference Result 167 states and 222 transitions. [2019-12-07 14:25:28,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:25:28,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-07 14:25:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,504 INFO L225 Difference]: With dead ends: 167 [2019-12-07 14:25:28,504 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 14:25:28,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-12-07 14:25:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 14:25:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-12-07 14:25:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 14:25:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-12-07 14:25:28,513 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 23 [2019-12-07 14:25:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,513 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-12-07 14:25:28,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-12-07 14:25:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 14:25:28,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,515 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,515 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash 970950199, now seen corresponding path program 1 times [2019-12-07 14:25:28,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153365581] [2019-12-07 14:25:28,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 14:25:28,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153365581] [2019-12-07 14:25:28,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:25:28,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806396523] [2019-12-07 14:25:28,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:28,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:28,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:28,554 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-12-07 14:25:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,601 INFO L93 Difference]: Finished difference Result 176 states and 226 transitions. [2019-12-07 14:25:28,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:25:28,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 14:25:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,604 INFO L225 Difference]: With dead ends: 176 [2019-12-07 14:25:28,604 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 14:25:28,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:25:28,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 14:25:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-12-07 14:25:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 14:25:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2019-12-07 14:25:28,616 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 34 [2019-12-07 14:25:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,616 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2019-12-07 14:25:28,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2019-12-07 14:25:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 14:25:28,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,618 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,618 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1027694963, now seen corresponding path program 1 times [2019-12-07 14:25:28,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256832767] [2019-12-07 14:25:28,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 14:25:28,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256832767] [2019-12-07 14:25:28,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:25:28,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108757875] [2019-12-07 14:25:28,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:25:28,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:25:28,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:25:28,650 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 4 states. [2019-12-07 14:25:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,667 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-12-07 14:25:28,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:25:28,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 14:25:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,669 INFO L225 Difference]: With dead ends: 104 [2019-12-07 14:25:28,669 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 14:25:28,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:25:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 14:25:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-12-07 14:25:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 14:25:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2019-12-07 14:25:28,679 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 37 [2019-12-07 14:25:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,680 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-12-07 14:25:28,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:25:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2019-12-07 14:25:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:25:28,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,681 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,682 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1793772729, now seen corresponding path program 1 times [2019-12-07 14:25:28,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217637378] [2019-12-07 14:25:28,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 14:25:28,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217637378] [2019-12-07 14:25:28,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:25:28,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484171182] [2019-12-07 14:25:28,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:28,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:28,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:28,708 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 3 states. [2019-12-07 14:25:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,716 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2019-12-07 14:25:28,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:28,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-12-07 14:25:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,718 INFO L225 Difference]: With dead ends: 101 [2019-12-07 14:25:28,718 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 14:25:28,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-12-07 14:25:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 14:25:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-07 14:25:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 14:25:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2019-12-07 14:25:28,727 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 38 [2019-12-07 14:25:28,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,727 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2019-12-07 14:25:28,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2019-12-07 14:25:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:25:28,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,729 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:28,729 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash -747989016, now seen corresponding path program 1 times [2019-12-07 14:25:28,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953462674] [2019-12-07 14:25:28,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 14:25:28,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953462674] [2019-12-07 14:25:28,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:28,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:25:28,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917900865] [2019-12-07 14:25:28,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:28,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:28,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:28,778 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 6 states. [2019-12-07 14:25:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:28,816 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2019-12-07 14:25:28,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:25:28,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 14:25:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:28,817 INFO L225 Difference]: With dead ends: 110 [2019-12-07 14:25:28,817 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 14:25:28,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:25:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 14:25:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-12-07 14:25:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 14:25:28,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-12-07 14:25:28,825 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 43 [2019-12-07 14:25:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:28,826 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-12-07 14:25:28,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-12-07 14:25:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:25:28,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:28,827 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-12-07 14:25:28,828 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:28,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1488967228, now seen corresponding path program 1 times [2019-12-07 14:25:28,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:28,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044883519] [2019-12-07 14:25:28,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 14:25:28,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044883519] [2019-12-07 14:25:28,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776928694] [2019-12-07 14:25:28,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/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-12-07 14:25:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:28,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:25:28,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 14:25:28,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:25:28,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-12-07 14:25:28,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212722609] [2019-12-07 14:25:28,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:25:28,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:28,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:25:28,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:25:28,979 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 7 states. [2019-12-07 14:25:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:29,039 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-12-07 14:25:29,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:25:29,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-07 14:25:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:29,041 INFO L225 Difference]: With dead ends: 100 [2019-12-07 14:25:29,041 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 14:25:29,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:25:29,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 14:25:29,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-12-07 14:25:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 14:25:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2019-12-07 14:25:29,049 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 40 [2019-12-07 14:25:29,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:29,049 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2019-12-07 14:25:29,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:25:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2019-12-07 14:25:29,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:25:29,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:29,050 INFO L410 BasicCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:29,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:29,252 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash 822906818, now seen corresponding path program 1 times [2019-12-07 14:25:29,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:29,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883102980] [2019-12-07 14:25:29,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 14:25:29,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883102980] [2019-12-07 14:25:29,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380136671] [2019-12-07 14:25:29,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/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-12-07 14:25:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:25:29,436 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 14:25:29,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:25:29,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-12-07 14:25:29,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349553624] [2019-12-07 14:25:29,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:25:29,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:29,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:25:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:25:29,479 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 7 states. [2019-12-07 14:25:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:29,579 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-12-07 14:25:29,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:25:29,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 14:25:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:29,581 INFO L225 Difference]: With dead ends: 126 [2019-12-07 14:25:29,581 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 14:25:29,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:25:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 14:25:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-12-07 14:25:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 14:25:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2019-12-07 14:25:29,589 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 52 [2019-12-07 14:25:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:29,590 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2019-12-07 14:25:29,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:25:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2019-12-07 14:25:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:25:29,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:29,591 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:29,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:29,791 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:29,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:29,791 INFO L82 PathProgramCache]: Analyzing trace with hash 695736933, now seen corresponding path program 1 times [2019-12-07 14:25:29,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:29,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244180156] [2019-12-07 14:25:29,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 14:25:29,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244180156] [2019-12-07 14:25:29,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309225628] [2019-12-07 14:25:29,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/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-12-07 14:25:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:29,873 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:25:29,875 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 14:25:29,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:25:29,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-12-07 14:25:29,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800626947] [2019-12-07 14:25:29,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:25:29,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:29,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:25:29,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:25:29,905 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand 5 states. [2019-12-07 14:25:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:29,940 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2019-12-07 14:25:29,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:29,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-07 14:25:29,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:29,942 INFO L225 Difference]: With dead ends: 152 [2019-12-07 14:25:29,942 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 14:25:29,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:25:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 14:25:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-12-07 14:25:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-12-07 14:25:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 184 transitions. [2019-12-07 14:25:29,952 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 184 transitions. Word has length 45 [2019-12-07 14:25:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:29,952 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 184 transitions. [2019-12-07 14:25:29,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:25:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2019-12-07 14:25:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 14:25:29,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:29,953 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:30,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:30,154 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:30,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:30,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1252678887, now seen corresponding path program 1 times [2019-12-07 14:25:30,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:30,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245376324] [2019-12-07 14:25:30,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 14:25:30,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245376324] [2019-12-07 14:25:30,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679338376] [2019-12-07 14:25:30,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/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-12-07 14:25:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:25:30,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 14:25:30,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:25:30,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-07 14:25:30,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304609702] [2019-12-07 14:25:30,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:30,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:30,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:30,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:30,256 INFO L87 Difference]: Start difference. First operand 150 states and 184 transitions. Second operand 6 states. [2019-12-07 14:25:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:30,277 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2019-12-07 14:25:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:30,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-07 14:25:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:30,279 INFO L225 Difference]: With dead ends: 159 [2019-12-07 14:25:30,279 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 14:25:30,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 14:25:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-12-07 14:25:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 14:25:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2019-12-07 14:25:30,288 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 60 [2019-12-07 14:25:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:30,288 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2019-12-07 14:25:30,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2019-12-07 14:25:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 14:25:30,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:30,289 INFO L410 BasicCegarLoop]: trace histogram [10, 8, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:30,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:30,491 INFO L410 AbstractCegarLoop]: === Iteration 19 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:30,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1438531096, now seen corresponding path program 2 times [2019-12-07 14:25:30,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:30,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593136296] [2019-12-07 14:25:30,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 14:25:30,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593136296] [2019-12-07 14:25:30,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662955643] [2019-12-07 14:25:30,588 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/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-12-07 14:25:30,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:25:30,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:25:30,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:25:30,617 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 14:25:30,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:25:30,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-12-07 14:25:30,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394172658] [2019-12-07 14:25:30,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:25:30,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:30,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:25:30,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:25:30,638 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand 13 states. [2019-12-07 14:25:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:30,757 INFO L93 Difference]: Finished difference Result 234 states and 284 transitions. [2019-12-07 14:25:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 14:25:30,757 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-12-07 14:25:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:30,758 INFO L225 Difference]: With dead ends: 234 [2019-12-07 14:25:30,758 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 14:25:30,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:25:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 14:25:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2019-12-07 14:25:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 14:25:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-12-07 14:25:30,762 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 77 [2019-12-07 14:25:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:30,762 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-12-07 14:25:30,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:25:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-12-07 14:25:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 14:25:30,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:30,763 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-12-07 14:25:30,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:30,964 INFO L410 AbstractCegarLoop]: === Iteration 20 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:25:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash -151262980, now seen corresponding path program 2 times [2019-12-07 14:25:30,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:30,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365028274] [2019-12-07 14:25:30,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 73 proven. 96 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-12-07 14:25:31,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365028274] [2019-12-07 14:25:31,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229886552] [2019-12-07 14:25:31,219 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/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-12-07 14:25:31,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:25:31,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:25:31,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 14:25:31,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:25:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 48 proven. 78 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-12-07 14:25:31,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:25:31,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 23 [2019-12-07 14:25:31,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689571137] [2019-12-07 14:25:31,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 14:25:31,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:25:31,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 14:25:31,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:25:31,313 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 23 states. [2019-12-07 14:25:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:31,560 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-12-07 14:25:31,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:25:31,560 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 124 [2019-12-07 14:25:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:31,561 INFO L225 Difference]: With dead ends: 95 [2019-12-07 14:25:31,561 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:25:31,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2019-12-07 14:25:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:25:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:25:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:25:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:25:31,562 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2019-12-07 14:25:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:31,562 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:25:31,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 14:25:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:25:31,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:25:31,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:25:31,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:25:32,158 INFO L246 CegarLoopResult]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,158 INFO L246 CegarLoopResult]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-12-07 14:25:32,158 INFO L246 CegarLoopResult]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,159 INFO L246 CegarLoopResult]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-12-07 14:25:32,159 INFO L246 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,159 INFO L249 CegarLoopResult]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-12-07 14:25:32,159 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,159 INFO L246 CegarLoopResult]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-12-07 14:25:32,159 INFO L242 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (and (or (= |rec1_#in~i| rec1_~i) (not (<= |rec1_#in~i| 2147483647))) (not (<= |rec1_#in~i| 0))) [2019-12-07 14:25:32,159 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,159 INFO L246 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,159 INFO L246 CegarLoopResult]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,159 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,159 INFO L242 CegarLoopResult]: At program point L14-6(line 14) the Hoare annotation is: (and (not (<= |rec1_#in~i| 0)) (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) (not (<= |rec1_#in~i| 2147483647)))) [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L242 CegarLoopResult]: At program point L14-8(line 14) the Hoare annotation is: (and (or (not (<= |rec1_#in~i| 2147483647)) (and (<= |rec1_#t~ret1| 0) (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1))) (or (<= 1 rec1_~i) (not (<= |rec1_#in~i| 2147483646)))) [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-12-07 14:25:32,160 INFO L246 CegarLoopResult]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-12-07 14:25:32,161 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= rec2_~j |rec2_#in~j|) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-12-07 14:25:32,161 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-12-07 14:25:32,161 INFO L242 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (not (<= |rec2_#in~j| 2147483647)))) (and (or (= rec2_~j |rec2_#in~j|) .cse0) (or (and (<= |rec2_#t~ret3| 1) (<= (+ |rec2_#t~ret3| 1) |rec2_#in~j|)) .cse0) (not (<= |rec2_#in~j| 0)))) [2019-12-07 14:25:32,161 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-12-07 14:25:32,161 INFO L246 CegarLoopResult]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-12-07 14:25:32,161 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-12-07 14:25:32,161 INFO L249 CegarLoopResult]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-12-07 14:25:32,161 INFO L246 CegarLoopResult]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 14:25:32,161 INFO L246 CegarLoopResult]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 14:25:32,161 INFO L246 CegarLoopResult]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 14:25:32,161 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:25:32,161 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 14:25:32,161 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 14:25:32,161 INFO L242 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-12-07 14:25:32,162 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-12-07 14:25:32,162 INFO L246 CegarLoopResult]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-12-07 14:25:32,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:25:32 BoogieIcfgContainer [2019-12-07 14:25:32,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:25:32,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:25:32,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:25:32,166 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:25:32,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:25:27" (3/4) ... [2019-12-07 14:25:32,168 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:25:32,172 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-12-07 14:25:32,172 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-12-07 14:25:32,176 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 14:25:32,176 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 14:25:32,205 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cdbd23cc-d498-447b-adac-dd91cb805dfa/bin/uautomizer/witness.graphml [2019-12-07 14:25:32,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:25:32,207 INFO L168 Benchmark]: Toolchain (without parser) took 4905.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 946.0 MB in the beginning and 888.4 MB in the end (delta: 57.7 MB). Peak memory consumption was 198.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:32,207 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:25:32,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:32,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:25:32,208 INFO L168 Benchmark]: Boogie Preprocessor took 11.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:25:32,208 INFO L168 Benchmark]: RCFGBuilder took 157.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:32,208 INFO L168 Benchmark]: TraceAbstraction took 4501.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 896.5 MB in the end (delta: 175.0 MB). Peak memory consumption was 216.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:32,209 INFO L168 Benchmark]: Witness Printer took 39.83 ms. Allocated memory is still 1.2 GB. Free memory was 896.5 MB in the beginning and 888.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:32,210 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 157.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4501.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 1.1 GB in the beginning and 896.5 MB in the end (delta: 175.0 MB). Peak memory consumption was 216.9 MB. Max. memory is 11.5 GB. * Witness Printer took 39.83 ms. Allocated memory is still 1.2 GB. Free memory was 896.5 MB in the beginning and 888.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 4.0s, OverallIterations: 20, TraceHistogramMax: 12, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 761 SDtfs, 331 SDslu, 2113 SDs, 0 SdLazy, 1002 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=18, 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, 20 MinimizatonAttempts, 93 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 222 PreInvPairs, 238 NumberOfFragments, 99 HoareAnnotationTreeSize, 222 FomulaSimplifications, 713 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 455 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1069 ConstructedInterpolants, 0 QuantifiedInterpolants, 115121 SizeOfPredicates, 8 NumberOfNonLiveVariables, 820 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 17 PerfectInterpolantSequences, 1315/1565 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...