./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/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 c27ad91a5bec233234e07a14bfd5505e082df4cd ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 05:43:35,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 05:43:35,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 05:43:35,747 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 05:43:35,747 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 05:43:35,748 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 05:43:35,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 05:43:35,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 05:43:35,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 05:43:35,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 05:43:35,753 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 05:43:35,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 05:43:35,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 05:43:35,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 05:43:35,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 05:43:35,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 05:43:35,758 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 05:43:35,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 05:43:35,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 05:43:35,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 05:43:35,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 05:43:35,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 05:43:35,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 05:43:35,767 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 05:43:35,767 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 05:43:35,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 05:43:35,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 05:43:35,770 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 05:43:35,771 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 05:43:35,772 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 05:43:35,772 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 05:43:35,773 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 05:43:35,773 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 05:43:35,773 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 05:43:35,775 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 05:43:35,776 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 05:43:35,776 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-10-27 05:43:35,788 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 05:43:35,789 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 05:43:35,789 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 05:43:35,790 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 05:43:35,790 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 05:43:35,791 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 05:43:35,791 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 05:43:35,791 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 05:43:35,791 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 05:43:35,792 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 05:43:35,792 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 05:43:35,792 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 05:43:35,792 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 05:43:35,793 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 05:43:35,793 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-10-27 05:43:35,793 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 05:43:35,793 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 05:43:35,793 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 05:43:35,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 05:43:35,794 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 05:43:35,794 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 05:43:35,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 05:43:35,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 05:43:35,796 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 05:43:35,796 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 05:43:35,797 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 05:43:35,797 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 05:43:35,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 05:43:35,797 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/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 -> c27ad91a5bec233234e07a14bfd5505e082df4cd [2018-10-27 05:43:35,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 05:43:35,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 05:43:35,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 05:43:35,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 05:43:35,845 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 05:43:35,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-10-27 05:43:35,889 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/data/24d264b6c/017770982d844eb2955ab4b4eea42f32/FLAGa31846dae [2018-10-27 05:43:36,301 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 05:43:36,301 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-10-27 05:43:36,307 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/data/24d264b6c/017770982d844eb2955ab4b4eea42f32/FLAGa31846dae [2018-10-27 05:43:36,319 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/data/24d264b6c/017770982d844eb2955ab4b4eea42f32 [2018-10-27 05:43:36,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 05:43:36,324 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 05:43:36,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 05:43:36,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 05:43:36,334 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 05:43:36,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:43:36" (1/1) ... [2018-10-27 05:43:36,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed79805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:43:36, skipping insertion in model container [2018-10-27 05:43:36,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 05:43:36" (1/1) ... [2018-10-27 05:43:36,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 05:43:36,367 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 05:43:36,488 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:43:36,492 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 05:43:36,507 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 05:43:36,519 INFO L193 MainTranslator]: Completed translation [2018-10-27 05:43:36,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:43:36 WrapperNode [2018-10-27 05:43:36,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 05:43:36,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 05:43:36,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 05:43:36,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 05:43:36,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:43:36" (1/1) ... [2018-10-27 05:43:36,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:43:36" (1/1) ... [2018-10-27 05:43:36,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:43:36" (1/1) ... [2018-10-27 05:43:36,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:43:36" (1/1) ... [2018-10-27 05:43:36,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:43:36" (1/1) ... [2018-10-27 05:43:36,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:43:36" (1/1) ... [2018-10-27 05:43:36,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:43:36" (1/1) ... [2018-10-27 05:43:36,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 05:43:36,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 05:43:36,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 05:43:36,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 05:43:36,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:43:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/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 [2018-10-27 05:43:36,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 05:43:36,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 05:43:36,662 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-10-27 05:43:36,662 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-10-27 05:43:36,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 05:43:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 05:43:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-10-27 05:43:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-10-27 05:43:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 05:43:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 05:43:36,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 05:43:37,157 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 05:43:37,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:43:37 BoogieIcfgContainer [2018-10-27 05:43:37,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 05:43:37,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 05:43:37,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 05:43:37,162 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 05:43:37,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 05:43:36" (1/3) ... [2018-10-27 05:43:37,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d00745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:43:37, skipping insertion in model container [2018-10-27 05:43:37,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 05:43:36" (2/3) ... [2018-10-27 05:43:37,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d00745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 05:43:37, skipping insertion in model container [2018-10-27 05:43:37,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:43:37" (3/3) ... [2018-10-27 05:43:37,165 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-10-27 05:43:37,174 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 05:43:37,181 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-10-27 05:43:37,194 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-10-27 05:43:37,218 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 05:43:37,219 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 05:43:37,219 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 05:43:37,219 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 05:43:37,219 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 05:43:37,219 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 05:43:37,219 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 05:43:37,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 05:43:37,219 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 05:43:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-10-27 05:43:37,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-27 05:43:37,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:37,244 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:43:37,246 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:37,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:37,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1878681222, now seen corresponding path program 1 times [2018-10-27 05:43:37,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:43:37,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:43:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:37,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:43:37,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:37,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:43:37,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:43:37,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:43:37,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:43:37,460 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 5 states. [2018-10-27 05:43:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:37,644 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-10-27 05:43:37,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 05:43:37,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-10-27 05:43:37,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:37,659 INFO L225 Difference]: With dead ends: 69 [2018-10-27 05:43:37,659 INFO L226 Difference]: Without dead ends: 60 [2018-10-27 05:43:37,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:43:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-27 05:43:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-10-27 05:43:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-27 05:43:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-10-27 05:43:37,728 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-10-27 05:43:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:37,729 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-10-27 05:43:37,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:43:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-10-27 05:43:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-27 05:43:37,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:37,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:43:37,735 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:37,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:37,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1890424319, now seen corresponding path program 1 times [2018-10-27 05:43:37,737 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:43:37,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:43:37,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:37,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:37,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:43:37,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:37,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:43:37,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:43:37,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:43:37,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:43:37,822 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-10-27 05:43:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:37,891 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-10-27 05:43:37,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:43:37,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-27 05:43:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:37,893 INFO L225 Difference]: With dead ends: 56 [2018-10-27 05:43:37,893 INFO L226 Difference]: Without dead ends: 54 [2018-10-27 05:43:37,894 INFO L605 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 [2018-10-27 05:43:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-27 05:43:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-10-27 05:43:37,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 05:43:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-10-27 05:43:37,904 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 10 [2018-10-27 05:43:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:37,904 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-10-27 05:43:37,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:43:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-10-27 05:43:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 05:43:37,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:37,905 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:43:37,906 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:37,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:37,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1814880932, now seen corresponding path program 1 times [2018-10-27 05:43:37,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:43:37,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:43:37,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:37,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:37,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 05:43:38,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:38,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 05:43:38,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:43:38,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:43:38,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:43:38,141 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 7 states. [2018-10-27 05:43:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:38,478 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-10-27 05:43:38,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 05:43:38,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-10-27 05:43:38,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:38,479 INFO L225 Difference]: With dead ends: 71 [2018-10-27 05:43:38,479 INFO L226 Difference]: Without dead ends: 69 [2018-10-27 05:43:38,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-27 05:43:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-27 05:43:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-10-27 05:43:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-27 05:43:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-10-27 05:43:38,489 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 17 [2018-10-27 05:43:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:38,490 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-10-27 05:43:38,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:43:38,490 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-10-27 05:43:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 05:43:38,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:38,490 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:43:38,491 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:38,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:38,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2069922715, now seen corresponding path program 1 times [2018-10-27 05:43:38,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:43:38,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:43:38,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:38,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:38,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 05:43:38,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:38,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:43:38,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:43:38,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:43:38,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:43:38,568 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 5 states. [2018-10-27 05:43:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:38,649 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-10-27 05:43:38,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:43:38,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-27 05:43:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:38,651 INFO L225 Difference]: With dead ends: 81 [2018-10-27 05:43:38,651 INFO L226 Difference]: Without dead ends: 80 [2018-10-27 05:43:38,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:43:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-27 05:43:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-10-27 05:43:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-27 05:43:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-10-27 05:43:38,663 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 20 [2018-10-27 05:43:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:38,663 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-10-27 05:43:38,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:43:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-10-27 05:43:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 05:43:38,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:38,664 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:43:38,665 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:38,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:38,667 INFO L82 PathProgramCache]: Analyzing trace with hash 256905316, now seen corresponding path program 1 times [2018-10-27 05:43:38,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:43:38,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:43:38,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:38,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:38,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:43:38,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:38,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 05:43:38,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 05:43:38,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 05:43:38,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 05:43:38,696 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 3 states. [2018-10-27 05:43:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:38,738 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-10-27 05:43:38,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 05:43:38,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-27 05:43:38,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:38,740 INFO L225 Difference]: With dead ends: 71 [2018-10-27 05:43:38,740 INFO L226 Difference]: Without dead ends: 70 [2018-10-27 05:43:38,740 INFO L605 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 [2018-10-27 05:43:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-27 05:43:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-10-27 05:43:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 05:43:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-10-27 05:43:38,749 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 21 [2018-10-27 05:43:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:38,750 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-10-27 05:43:38,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 05:43:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2018-10-27 05:43:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 05:43:38,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:38,752 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:43:38,752 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:38,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:38,752 INFO L82 PathProgramCache]: Analyzing trace with hash -831628633, now seen corresponding path program 1 times [2018-10-27 05:43:38,753 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:43:38,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:43:38,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:38,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:38,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 05:43:39,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:39,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 05:43:39,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:43:39,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:43:39,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:43:39,017 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 5 states. [2018-10-27 05:43:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:39,113 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2018-10-27 05:43:39,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:43:39,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-27 05:43:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:39,115 INFO L225 Difference]: With dead ends: 127 [2018-10-27 05:43:39,115 INFO L226 Difference]: Without dead ends: 66 [2018-10-27 05:43:39,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:43:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-27 05:43:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-27 05:43:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 05:43:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-10-27 05:43:39,125 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 25 [2018-10-27 05:43:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:39,125 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-10-27 05:43:39,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:43:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-10-27 05:43:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 05:43:39,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:39,128 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:43:39,128 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:39,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1630439354, now seen corresponding path program 1 times [2018-10-27 05:43:39,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:43:39,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:43:39,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:39,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:39,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:43:39,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:39,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:43:39,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:43:39,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:43:39,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:43:39,170 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 5 states. [2018-10-27 05:43:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:39,216 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-10-27 05:43:39,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:43:39,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-27 05:43:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:39,218 INFO L225 Difference]: With dead ends: 76 [2018-10-27 05:43:39,218 INFO L226 Difference]: Without dead ends: 75 [2018-10-27 05:43:39,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:43:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-27 05:43:39,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-10-27 05:43:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-27 05:43:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2018-10-27 05:43:39,226 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 25 [2018-10-27 05:43:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:39,226 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2018-10-27 05:43:39,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:43:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2018-10-27 05:43:39,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 05:43:39,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:39,228 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:43:39,228 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:39,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:39,229 INFO L82 PathProgramCache]: Analyzing trace with hash -995987509, now seen corresponding path program 1 times [2018-10-27 05:43:39,229 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:43:39,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:43:39,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:39,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:39,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 05:43:39,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:39,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:43:39,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:43:39,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:43:39,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:43:39,277 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 5 states. [2018-10-27 05:43:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:39,337 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-10-27 05:43:39,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:43:39,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-10-27 05:43:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:39,339 INFO L225 Difference]: With dead ends: 79 [2018-10-27 05:43:39,339 INFO L226 Difference]: Without dead ends: 75 [2018-10-27 05:43:39,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:43:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-27 05:43:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-10-27 05:43:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-27 05:43:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2018-10-27 05:43:39,350 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 26 [2018-10-27 05:43:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:39,351 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2018-10-27 05:43:39,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:43:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2018-10-27 05:43:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 05:43:39,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:39,354 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:43:39,354 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:39,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:39,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1986621902, now seen corresponding path program 1 times [2018-10-27 05:43:39,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:43:39,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:43:39,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:39,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:39,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 05:43:39,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:39,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 05:43:39,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:43:39,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:43:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:43:39,467 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 7 states. [2018-10-27 05:43:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:39,736 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2018-10-27 05:43:39,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:43:39,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-10-27 05:43:39,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:39,738 INFO L225 Difference]: With dead ends: 111 [2018-10-27 05:43:39,738 INFO L226 Difference]: Without dead ends: 110 [2018-10-27 05:43:39,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:43:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-27 05:43:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 83. [2018-10-27 05:43:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-27 05:43:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2018-10-27 05:43:39,749 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 46 [2018-10-27 05:43:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:39,753 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2018-10-27 05:43:39,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:43:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2018-10-27 05:43:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 05:43:39,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:39,755 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 05:43:39,755 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:39,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:39,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1408540422, now seen corresponding path program 1 times [2018-10-27 05:43:39,756 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:43:39,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:43:39,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:39,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:39,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 05:43:39,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 05:43:39,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 05:43:39,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 05:43:39,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 05:43:39,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 05:43:39,824 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 5 states. [2018-10-27 05:43:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:39,950 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-10-27 05:43:39,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 05:43:39,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-10-27 05:43:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:39,953 INFO L225 Difference]: With dead ends: 85 [2018-10-27 05:43:39,953 INFO L226 Difference]: Without dead ends: 84 [2018-10-27 05:43:39,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 05:43:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-27 05:43:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-10-27 05:43:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-27 05:43:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2018-10-27 05:43:39,965 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 51 [2018-10-27 05:43:39,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:39,965 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2018-10-27 05:43:39,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 05:43:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-10-27 05:43:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-27 05:43:39,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 05:43:39,969 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 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] [2018-10-27 05:43:39,969 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-10-27 05:43:39,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 05:43:39,970 INFO L82 PathProgramCache]: Analyzing trace with hash 859454554, now seen corresponding path program 1 times [2018-10-27 05:43:39,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 05:43:39,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 05:43:39,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:39,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:39,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 05:43:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 05:43:40,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 05:43:40,070 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 05:43:40,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 05:43:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 05:43:40,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 05:43:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 05:43:40,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 05:43:40,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-27 05:43:40,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 05:43:40,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 05:43:40,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-27 05:43:40,196 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 7 states. [2018-10-27 05:43:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 05:43:40,340 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2018-10-27 05:43:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 05:43:40,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-10-27 05:43:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 05:43:40,343 INFO L225 Difference]: With dead ends: 123 [2018-10-27 05:43:40,344 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 05:43:40,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-27 05:43:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 05:43:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 05:43:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 05:43:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 05:43:40,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-10-27 05:43:40,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 05:43:40,347 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 05:43:40,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 05:43:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 05:43:40,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 05:43:40,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 05:43:40,646 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 05:43:40,646 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:43:40,646 INFO L425 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:43:40,646 INFO L425 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:43:40,646 INFO L425 ceAbstractionStarter]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2018-10-27 05:43:40,646 INFO L425 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:43:40,646 INFO L421 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (or (and (<= |f_#in~x| f_~x) (<= f_~x 2147483647) (<= 1 f_~x)) (< 2147483647 |f_#in~x|)) [2018-10-27 05:43:40,647 INFO L425 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-10-27 05:43:40,647 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-10-27 05:43:40,647 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-10-27 05:43:40,647 INFO L425 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2018-10-27 05:43:40,647 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-10-27 05:43:40,647 INFO L421 ceAbstractionStarter]: At program point L14-4(line 14) the Hoare annotation is: (or (and (<= f_~x 2147483646) (<= |f_#in~x| f_~x) (<= 1 f_~x)) (< 2147483647 |f_#in~x|)) [2018-10-27 05:43:40,647 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-10-27 05:43:40,647 INFO L425 ceAbstractionStarter]: For program point L14-6(line 14) no Hoare annotation was computed. [2018-10-27 05:43:40,647 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2018-10-27 05:43:40,647 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-10-27 05:43:40,647 INFO L428 ceAbstractionStarter]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2018-10-27 05:43:40,648 INFO L425 ceAbstractionStarter]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,648 INFO L425 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,648 INFO L425 ceAbstractionStarter]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,648 INFO L425 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,648 INFO L425 ceAbstractionStarter]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2018-10-27 05:43:40,648 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,648 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2018-10-27 05:43:40,648 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,648 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= 1 g_~x) (<= g_~x 2147483647) (<= |g_#in~x| g_~x)) (< 2147483647 |g_#in~x|)) [2018-10-27 05:43:40,649 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,649 INFO L425 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,649 INFO L425 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,649 INFO L425 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,649 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,649 INFO L421 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (or (and (<= 1 g_~x) (<= 0 (+ |g_#t~ret2| 2147483648)) (<= g_~x 2147483647) (<= |g_#t~ret2| 2147483647) (<= |g_#in~x| 1)) (< 2147483647 |g_#in~x|)) [2018-10-27 05:43:40,649 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,649 INFO L425 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,649 INFO L425 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2018-10-27 05:43:40,649 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2018-10-27 05:43:40,650 INFO L428 ceAbstractionStarter]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2018-10-27 05:43:40,650 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 05:43:40,650 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 05:43:40,650 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 05:43:40,650 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 05:43:40,650 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 24 27) the Hoare annotation is: true [2018-10-27 05:43:40,650 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 24 27) no Hoare annotation was computed. [2018-10-27 05:43:40,650 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-10-27 05:43:40,650 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-10-27 05:43:40,650 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 24 27) no Hoare annotation was computed. [2018-10-27 05:43:40,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 05:43:40 BoogieIcfgContainer [2018-10-27 05:43:40,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 05:43:40,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 05:43:40,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 05:43:40,654 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 05:43:40,654 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 05:43:37" (3/4) ... [2018-10-27 05:43:40,658 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 05:43:40,663 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 05:43:40,663 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-10-27 05:43:40,663 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-10-27 05:43:40,663 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 05:43:40,667 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-27 05:43:40,667 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-27 05:43:40,668 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 05:43:40,703 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_57cb767c-4441-475f-ae1a-b29669f6699b/bin-2019/uautomizer/witness.graphml [2018-10-27 05:43:40,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 05:43:40,704 INFO L168 Benchmark]: Toolchain (without parser) took 4381.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 960.2 MB in the beginning and 913.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 220.8 MB. Max. memory is 11.5 GB. [2018-10-27 05:43:40,705 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:43:40,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.97 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 05:43:40,706 INFO L168 Benchmark]: Boogie Preprocessor took 25.86 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 05:43:40,708 INFO L168 Benchmark]: RCFGBuilder took 611.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 949.5 MB in the beginning and 1.2 GB in the end (delta: -206.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-10-27 05:43:40,708 INFO L168 Benchmark]: TraceAbstraction took 3494.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 916.9 MB in the end (delta: 238.6 MB). Peak memory consumption was 238.6 MB. Max. memory is 11.5 GB. [2018-10-27 05:43:40,709 INFO L168 Benchmark]: Witness Printer took 49.86 ms. Allocated memory is still 1.2 GB. Free memory was 916.9 MB in the beginning and 913.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-27 05:43:40,711 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.97 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.86 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 611.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 949.5 MB in the beginning and 1.2 GB in the end (delta: -206.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3494.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 916.9 MB in the end (delta: 238.6 MB). Peak memory consumption was 238.6 MB. Max. memory is 11.5 GB. * Witness Printer took 49.86 ms. Allocated memory is still 1.2 GB. Free memory was 916.9 MB in the beginning and 913.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 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: 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 5 procedures, 47 locations, 10 error locations. SAFE Result, 3.4s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 391 SDtfs, 271 SDslu, 920 SDs, 0 SdLazy, 470 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 62 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 77 PreInvPairs, 86 NumberOfFragments, 77 HoareAnnotationTreeSize, 77 FomulaSimplifications, 290 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 108 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 24919 SizeOfPredicates, 3 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 197/203 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...