./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/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 9072a9376e1e28de1ef4dc11b7134f6f175023b7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:53:40,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:53:40,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:53:40,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:53:40,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:53:40,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:53:40,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:53:40,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:53:40,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:53:40,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:53:40,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:53:40,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:53:40,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:53:40,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:53:40,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:53:40,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:53:40,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:53:40,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:53:40,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:53:40,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:53:40,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:53:40,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:53:40,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:53:40,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:53:40,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:53:40,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:53:40,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:53:40,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:53:40,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:53:40,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:53:40,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:53:40,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:53:40,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:53:40,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:53:40,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:53:40,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:53:40,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:53:40,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:53:40,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:53:40,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:53:40,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:53:40,897 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-25 08:53:40,921 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:53:40,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:53:40,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:53:40,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:53:40,933 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:53:40,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:53:40,933 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:53:40,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:53:40,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:53:40,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:53:40,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:53:40,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:53:40,934 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-25 08:53:40,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:53:40,935 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:53:40,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:53:40,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:53:40,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:53:40,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:53:40,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:53:40,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:53:40,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:53:40,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:53:40,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:53:40,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:53:40,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:53:40,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:53:40,939 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_a57f827c-2732-46ad-80ce-daedb7ad43f1/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 -> 9072a9376e1e28de1ef4dc11b7134f6f175023b7 [2019-11-25 08:53:41,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:53:41,133 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:53:41,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:53:41,138 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:53:41,138 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:53:41,139 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2019-11-25 08:53:41,199 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/data/4f59a7df5/15e4cded660745b58854e3a8adf5e64e/FLAG8b4a84dc9 [2019-11-25 08:53:41,586 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:53:41,587 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2019-11-25 08:53:41,594 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/data/4f59a7df5/15e4cded660745b58854e3a8adf5e64e/FLAG8b4a84dc9 [2019-11-25 08:53:42,011 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/data/4f59a7df5/15e4cded660745b58854e3a8adf5e64e [2019-11-25 08:53:42,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:53:42,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:53:42,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:42,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:53:42,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:53:42,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:42" (1/1) ... [2019-11-25 08:53:42,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@215ffab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42, skipping insertion in model container [2019-11-25 08:53:42,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:42" (1/1) ... [2019-11-25 08:53:42,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:53:42,050 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:53:42,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:42,337 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:53:42,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:42,368 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:53:42,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42 WrapperNode [2019-11-25 08:53:42,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:42,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:42,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:53:42,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:53:42,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42" (1/1) ... [2019-11-25 08:53:42,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42" (1/1) ... [2019-11-25 08:53:42,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:42,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:53:42,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:53:42,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:53:42,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42" (1/1) ... [2019-11-25 08:53:42,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42" (1/1) ... [2019-11-25 08:53:42,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42" (1/1) ... [2019-11-25 08:53:42,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42" (1/1) ... [2019-11-25 08:53:42,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42" (1/1) ... [2019-11-25 08:53:42,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42" (1/1) ... [2019-11-25 08:53:42,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42" (1/1) ... [2019-11-25 08:53:42,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:53:42,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:53:42,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:53:42,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:53:42,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:53:42,466 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-25 08:53:42,466 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-25 08:53:42,466 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-25 08:53:42,466 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-25 08:53:42,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:53:42,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:53:42,653 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:53:42,654 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-25 08:53:42,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:42 BoogieIcfgContainer [2019-11-25 08:53:42,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:53:42,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:53:42,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:53:42,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:53:42,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:53:42" (1/3) ... [2019-11-25 08:53:42,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c24adbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:42, skipping insertion in model container [2019-11-25 08:53:42,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:42" (2/3) ... [2019-11-25 08:53:42,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c24adbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:42, skipping insertion in model container [2019-11-25 08:53:42,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:42" (3/3) ... [2019-11-25 08:53:42,662 INFO L109 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1b.c [2019-11-25 08:53:42,671 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:53:42,677 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-25 08:53:42,688 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-25 08:53:42,727 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:53:42,727 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:53:42,727 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:53:42,727 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:53:42,727 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:53:42,728 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:53:42,728 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:53:42,728 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:53:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-25 08:53:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-25 08:53:42,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:42,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-25 08:53:42,768 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:42,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:42,777 INFO L82 PathProgramCache]: Analyzing trace with hash 68150020, now seen corresponding path program 1 times [2019-11-25 08:53:42,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:42,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822754549] [2019-11-25 08:53:42,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:42,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822754549] [2019-11-25 08:53:42,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:42,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:42,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761733927] [2019-11-25 08:53:42,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:53:42,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:42,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:53:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:42,958 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-11-25 08:53:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:43,097 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-11-25 08:53:43,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:53:43,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-11-25 08:53:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:43,112 INFO L225 Difference]: With dead ends: 64 [2019-11-25 08:53:43,112 INFO L226 Difference]: Without dead ends: 56 [2019-11-25 08:53:43,116 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-11-25 08:53:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-25 08:53:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-11-25 08:53:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-25 08:53:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-11-25 08:53:43,167 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-11-25 08:53:43,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:43,168 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-11-25 08:53:43,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:53:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-11-25 08:53:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-25 08:53:43,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:43,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:53:43,169 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2112650676, now seen corresponding path program 1 times [2019-11-25 08:53:43,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:43,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150122289] [2019-11-25 08:53:43,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:43,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150122289] [2019-11-25 08:53:43,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:43,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:43,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230295099] [2019-11-25 08:53:43,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:43,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:43,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:43,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:43,192 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-11-25 08:53:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:43,214 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-11-25 08:53:43,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:43,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-25 08:53:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:43,216 INFO L225 Difference]: With dead ends: 52 [2019-11-25 08:53:43,216 INFO L226 Difference]: Without dead ends: 50 [2019-11-25 08:53:43,217 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-11-25 08:53:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-25 08:53:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-11-25 08:53:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-25 08:53:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-11-25 08:53:43,227 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2019-11-25 08:53:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:43,227 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-11-25 08:53:43,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-11-25 08:53:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 08:53:43,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:43,228 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:43,229 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash 803040358, now seen corresponding path program 1 times [2019-11-25 08:53:43,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:43,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794492566] [2019-11-25 08:53:43,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:53:43,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794492566] [2019-11-25 08:53:43,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:43,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:53:43,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888252881] [2019-11-25 08:53:43,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:53:43,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:43,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:53:43,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:53:43,329 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 9 states. [2019-11-25 08:53:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:43,573 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-11-25 08:53:43,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:53:43,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-11-25 08:53:43,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:43,575 INFO L225 Difference]: With dead ends: 66 [2019-11-25 08:53:43,575 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 08:53:43,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:53:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 08:53:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-11-25 08:53:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-25 08:53:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-11-25 08:53:43,587 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 13 [2019-11-25 08:53:43,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:43,587 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-11-25 08:53:43,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:53:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-11-25 08:53:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 08:53:43,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:43,589 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:43,589 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:43,590 INFO L82 PathProgramCache]: Analyzing trace with hash -265858514, now seen corresponding path program 1 times [2019-11-25 08:53:43,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:43,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468016310] [2019-11-25 08:53:43,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:53:43,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468016310] [2019-11-25 08:53:43,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:43,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:43,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744286626] [2019-11-25 08:53:43,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:43,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:43,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:43,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:43,634 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 3 states. [2019-11-25 08:53:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:43,652 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2019-11-25 08:53:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:43,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-25 08:53:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:43,658 INFO L225 Difference]: With dead ends: 61 [2019-11-25 08:53:43,658 INFO L226 Difference]: Without dead ends: 60 [2019-11-25 08:53:43,659 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-11-25 08:53:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-25 08:53:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-25 08:53:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-25 08:53:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-11-25 08:53:43,676 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 17 [2019-11-25 08:53:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:43,677 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-11-25 08:53:43,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-11-25 08:53:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:53:43,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:43,679 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:43,683 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:43,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1650762684, now seen corresponding path program 1 times [2019-11-25 08:53:43,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:43,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120095112] [2019-11-25 08:53:43,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 08:53:43,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120095112] [2019-11-25 08:53:43,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:43,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:43,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887025284] [2019-11-25 08:53:43,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:53:43,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:43,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:53:43,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:43,771 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2019-11-25 08:53:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:43,823 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-11-25 08:53:43,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:53:43,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-25 08:53:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:43,826 INFO L225 Difference]: With dead ends: 93 [2019-11-25 08:53:43,826 INFO L226 Difference]: Without dead ends: 92 [2019-11-25 08:53:43,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:53:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-25 08:53:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2019-11-25 08:53:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-25 08:53:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-11-25 08:53:43,840 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 21 [2019-11-25 08:53:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:43,841 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-11-25 08:53:43,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:53:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2019-11-25 08:53:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:53:43,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:43,843 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:43,843 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:43,843 INFO L82 PathProgramCache]: Analyzing trace with hash 365964416, now seen corresponding path program 1 times [2019-11-25 08:53:43,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:43,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227381256] [2019-11-25 08:53:43,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 08:53:43,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227381256] [2019-11-25 08:53:43,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:43,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:53:43,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963693498] [2019-11-25 08:53:43,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:53:43,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:43,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:53:43,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:43,897 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 5 states. [2019-11-25 08:53:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:43,955 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2019-11-25 08:53:43,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:53:43,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 08:53:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:43,957 INFO L225 Difference]: With dead ends: 93 [2019-11-25 08:53:43,958 INFO L226 Difference]: Without dead ends: 89 [2019-11-25 08:53:43,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:53:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-25 08:53:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2019-11-25 08:53:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-25 08:53:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2019-11-25 08:53:43,969 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 22 [2019-11-25 08:53:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:43,970 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2019-11-25 08:53:43,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:53:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2019-11-25 08:53:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 08:53:43,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:43,971 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:43,972 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:43,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2082036524, now seen corresponding path program 1 times [2019-11-25 08:53:43,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:43,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760657955] [2019-11-25 08:53:43,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 08:53:44,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760657955] [2019-11-25 08:53:44,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653848896] [2019-11-25 08:53:44,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:44,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:53:44,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 08:53:44,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:53:44,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2019-11-25 08:53:44,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713572882] [2019-11-25 08:53:44,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 08:53:44,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:44,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 08:53:44,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:53:44,258 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 14 states. [2019-11-25 08:53:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:44,684 INFO L93 Difference]: Finished difference Result 198 states and 268 transitions. [2019-11-25 08:53:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:53:44,685 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-25 08:53:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:44,687 INFO L225 Difference]: With dead ends: 198 [2019-11-25 08:53:44,687 INFO L226 Difference]: Without dead ends: 127 [2019-11-25 08:53:44,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-11-25 08:53:44,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-25 08:53:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 103. [2019-11-25 08:53:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-25 08:53:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2019-11-25 08:53:44,714 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 32 [2019-11-25 08:53:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:44,715 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2019-11-25 08:53:44,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 08:53:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2019-11-25 08:53:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:53:44,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:44,717 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:44,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:44,933 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:44,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1488102097, now seen corresponding path program 1 times [2019-11-25 08:53:44,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:44,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977871225] [2019-11-25 08:53:44,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 08:53:45,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977871225] [2019-11-25 08:53:45,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567608268] [2019-11-25 08:53:45,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:53:45,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:53:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:53:45,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:53:45,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-11-25 08:53:45,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915245747] [2019-11-25 08:53:45,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:53:45,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:45,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:53:45,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:53:45,107 INFO L87 Difference]: Start difference. First operand 103 states and 131 transitions. Second operand 5 states. [2019-11-25 08:53:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:45,194 INFO L93 Difference]: Finished difference Result 178 states and 234 transitions. [2019-11-25 08:53:45,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:53:45,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-25 08:53:45,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:45,196 INFO L225 Difference]: With dead ends: 178 [2019-11-25 08:53:45,196 INFO L226 Difference]: Without dead ends: 78 [2019-11-25 08:53:45,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:53:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-25 08:53:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-25 08:53:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-25 08:53:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2019-11-25 08:53:45,210 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 24 [2019-11-25 08:53:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:45,211 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2019-11-25 08:53:45,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:53:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2019-11-25 08:53:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-25 08:53:45,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:45,214 INFO L410 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-25 08:53:45,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:53:45,415 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:45,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:45,416 INFO L82 PathProgramCache]: Analyzing trace with hash 627143089, now seen corresponding path program 1 times [2019-11-25 08:53:45,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:45,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653259060] [2019-11-25 08:53:45,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-25 08:53:45,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653259060] [2019-11-25 08:53:45,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:45,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:53:45,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769574537] [2019-11-25 08:53:45,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:53:45,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:45,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:53:45,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:53:45,618 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 8 states. [2019-11-25 08:53:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:45,690 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2019-11-25 08:53:45,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:53:45,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-11-25 08:53:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:45,692 INFO L225 Difference]: With dead ends: 78 [2019-11-25 08:53:45,692 INFO L226 Difference]: Without dead ends: 76 [2019-11-25 08:53:45,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:53:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-25 08:53:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-25 08:53:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-25 08:53:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2019-11-25 08:53:45,700 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 94 [2019-11-25 08:53:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:45,701 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2019-11-25 08:53:45,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:53:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2019-11-25 08:53:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:53:45,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:45,703 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:45,703 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-25 08:53:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash -319407487, now seen corresponding path program 1 times [2019-11-25 08:53:45,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:45,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566522736] [2019-11-25 08:53:45,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-25 08:53:45,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566522736] [2019-11-25 08:53:45,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:45,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:53:45,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348127323] [2019-11-25 08:53:45,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:53:45,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:45,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:53:45,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:53:45,826 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 8 states. [2019-11-25 08:53:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:45,886 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2019-11-25 08:53:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:53:45,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-11-25 08:53:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:45,887 INFO L225 Difference]: With dead ends: 76 [2019-11-25 08:53:45,888 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:53:45,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:53:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:53:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:53:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:53:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:53:45,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2019-11-25 08:53:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:45,889 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:53:45,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:53:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:53:45,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:53:45,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:53:46,153 INFO L444 ceAbstractionStarter]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2019-11-25 08:53:46,153 INFO L440 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (or (and (<= 1 f_~x) (= |f_#in~x| f_~x)) (not (<= |f_#in~x| 2147483645))) [2019-11-25 08:53:46,153 INFO L444 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-11-25 08:53:46,154 INFO L444 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-25 08:53:46,154 INFO L444 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2019-11-25 08:53:46,154 INFO L444 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-25 08:53:46,154 INFO L440 ceAbstractionStarter]: At program point L14-4(line 14) the Hoare annotation is: (or (and (<= 0 |f_#t~ret0|) (<= |f_#t~ret0| 0) (<= 1 f_~x) (= |f_#in~x| f_~x)) (not (<= |f_#in~x| 2147483645))) [2019-11-25 08:53:46,154 INFO L444 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-25 08:53:46,154 INFO L444 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-25 08:53:46,154 INFO L444 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-25 08:53:46,154 INFO L444 ceAbstractionStarter]: For program point L14-6(line 14) no Hoare annotation was computed. [2019-11-25 08:53:46,155 INFO L444 ceAbstractionStarter]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2019-11-25 08:53:46,155 INFO L444 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-25 08:53:46,155 INFO L447 ceAbstractionStarter]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2019-11-25 08:53:46,155 INFO L444 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-25 08:53:46,155 INFO L444 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-25 08:53:46,155 INFO L444 ceAbstractionStarter]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2019-11-25 08:53:46,155 INFO L444 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,155 INFO L444 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2019-11-25 08:53:46,156 INFO L444 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,156 INFO L440 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= |g_#in~x| g_~x) (not (<= |g_#in~x| 2147483647))) (or (not (<= |g_#in~x| 2147483645)) (<= 1 g_~x))) [2019-11-25 08:53:46,156 INFO L444 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,156 INFO L444 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,156 INFO L444 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,156 INFO L440 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (or (and (<= 0 |g_#t~ret2|) (<= 1 g_~x) (<= |g_#t~ret2| 0) (= |g_#in~x| g_~x)) (not (<= |g_#in~x| 2147483647))) [2019-11-25 08:53:46,156 INFO L444 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,157 INFO L444 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,157 INFO L444 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,157 INFO L444 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,157 INFO L444 ceAbstractionStarter]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2019-11-25 08:53:46,157 INFO L444 ceAbstractionStarter]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,157 INFO L447 ceAbstractionStarter]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2019-11-25 08:53:46,157 INFO L444 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,158 INFO L444 ceAbstractionStarter]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,158 INFO L444 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,158 INFO L444 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-25 08:53:46,158 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:53:46,158 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:53:46,158 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:53:46,158 INFO L440 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-25 08:53:46,158 INFO L444 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-25 08:53:46,159 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 27) no Hoare annotation was computed. [2019-11-25 08:53:46,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:53:46 BoogieIcfgContainer [2019-11-25 08:53:46,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:53:46,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:53:46,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:53:46,162 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:53:46,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:42" (3/4) ... [2019-11-25 08:53:46,169 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:53:46,179 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-25 08:53:46,179 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-25 08:53:46,189 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-25 08:53:46,189 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:53:46,236 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a57f827c-2732-46ad-80ce-daedb7ad43f1/bin/uautomizer/witness.graphml [2019-11-25 08:53:46,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:53:46,238 INFO L168 Benchmark]: Toolchain (without parser) took 4223.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.1 MB in the beginning and 777.2 MB in the end (delta: 172.9 MB). Peak memory consumption was 308.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:46,239 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:53:46,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:46,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:53:46,240 INFO L168 Benchmark]: Boogie Preprocessor took 15.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:53:46,240 INFO L168 Benchmark]: RCFGBuilder took 242.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:46,241 INFO L168 Benchmark]: TraceAbstraction took 3505.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 777.2 MB in the end (delta: 323.3 MB). Peak memory consumption was 323.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:46,241 INFO L168 Benchmark]: Witness Printer took 74.51 ms. Allocated memory is still 1.2 GB. Free memory is still 777.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:53:46,243 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.52 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 242.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3505.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 777.2 MB in the end (delta: 323.3 MB). Peak memory consumption was 323.3 MB. Max. memory is 11.5 GB. * Witness Printer took 74.51 ms. Allocated memory is still 1.2 GB. Free memory is still 777.2 MB. There was no memory consumed. 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: 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 - 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, 42 locations, 10 error locations. Result: SAFE, OverallTime: 3.4s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 307 SDtfs, 289 SDslu, 944 SDs, 0 SdLazy, 605 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=7, 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, 10 MinimizatonAttempts, 63 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 103 PreInvPairs, 115 NumberOfFragments, 70 HoareAnnotationTreeSize, 103 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 148 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 36147 SizeOfPredicates, 5 NumberOfNonLiveVariables, 122 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 293/299 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...