./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/busybox-1.22.0/hostid.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/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 8604245f5a4dee50703be8e530b281b92acb588c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:24:32,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:24:32,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:24:32,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:24:32,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:24:32,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:24:32,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:24:32,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:24:32,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:24:32,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:24:32,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:24:32,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:24:32,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:24:32,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:24:32,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:24:32,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:24:32,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:24:32,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:24:32,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:24:32,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:24:32,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:24:32,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:24:32,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:24:32,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:24:32,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:24:32,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:24:32,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:24:32,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:24:32,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:24:32,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:24:32,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:24:32,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:24:32,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:24:32,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:24:32,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:24:32,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:24:32,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:24:32,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:24:32,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:24:32,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:24:32,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:24:32,659 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-15 23:24:32,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:24:32,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:24:32,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:24:32,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:24:32,676 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:24:32,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:24:32,677 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:24:32,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:24:32,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:24:32,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:24:32,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:24:32,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:24:32,678 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-15 23:24:32,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:24:32,679 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:24:32,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:24:32,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:24:32,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:24:32,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:24:32,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:24:32,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:24:32,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:24:32,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:24:32,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:24:32,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:24:32,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:24:32,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:24:32,682 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_b84e940c-ab57-48b9-b07b-3910074a6714/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 -> 8604245f5a4dee50703be8e530b281b92acb588c [2019-11-15 23:24:32,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:24:32,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:24:32,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:24:32,729 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:24:32,730 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:24:32,730 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/../../sv-benchmarks/c/busybox-1.22.0/hostid.i [2019-11-15 23:24:32,807 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/data/357deade8/d13fbb1b0f5d401aa6a34765ea1e5135/FLAG490034dac [2019-11-15 23:24:33,420 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:24:33,422 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/sv-benchmarks/c/busybox-1.22.0/hostid.i [2019-11-15 23:24:33,461 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/data/357deade8/d13fbb1b0f5d401aa6a34765ea1e5135/FLAG490034dac [2019-11-15 23:24:33,573 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/data/357deade8/d13fbb1b0f5d401aa6a34765ea1e5135 [2019-11-15 23:24:33,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:24:33,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:24:33,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:33,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:24:33,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:24:33,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:33" (1/1) ... [2019-11-15 23:24:33,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2653a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:33, skipping insertion in model container [2019-11-15 23:24:33,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:33" (1/1) ... [2019-11-15 23:24:33,601 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:24:33,699 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:24:34,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:34,851 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:24:34,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:35,391 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:24:35,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35 WrapperNode [2019-11-15 23:24:35,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:35,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:24:35,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:24:35,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:24:35,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:24:35,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:24:35,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:24:35,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:24:35,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... [2019-11-15 23:24:35,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:24:35,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:24:35,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:24:35,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:24:35,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:24:35,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:24:35,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:24:35,725 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-11-15 23:24:35,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:24:35,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:24:35,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:24:35,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:24:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:24:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:24:35,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 23:24:36,784 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:24:36,784 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-15 23:24:36,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:36 BoogieIcfgContainer [2019-11-15 23:24:36,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:24:36,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:24:36,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:24:36,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:24:36,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:24:33" (1/3) ... [2019-11-15 23:24:36,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3289abb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:24:36, skipping insertion in model container [2019-11-15 23:24:36,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:35" (2/3) ... [2019-11-15 23:24:36,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3289abb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:24:36, skipping insertion in model container [2019-11-15 23:24:36,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:36" (3/3) ... [2019-11-15 23:24:36,796 INFO L109 eAbstractionObserver]: Analyzing ICFG hostid.i [2019-11-15 23:24:36,812 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:24:36,820 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-15 23:24:36,833 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-15 23:24:36,864 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:24:36,864 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:24:36,864 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:24:36,865 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:24:36,865 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:24:36,865 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:24:36,865 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:24:36,865 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:24:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-11-15 23:24:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-15 23:24:36,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:36,895 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-15 23:24:36,898 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:36,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:36,904 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-15 23:24:36,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:36,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674968390] [2019-11-15 23:24:36,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:36,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:36,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:37,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674968390] [2019-11-15 23:24:37,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:37,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:37,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790628485] [2019-11-15 23:24:37,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:37,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:37,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:37,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:37,364 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-11-15 23:24:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:37,413 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2019-11-15 23:24:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:37,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-15 23:24:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:37,425 INFO L225 Difference]: With dead ends: 92 [2019-11-15 23:24:37,425 INFO L226 Difference]: Without dead ends: 45 [2019-11-15 23:24:37,429 INFO L600 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-15 23:24:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-15 23:24:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-15 23:24:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 23:24:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-15 23:24:37,474 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2019-11-15 23:24:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:37,475 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-15 23:24:37,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-15 23:24:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-15 23:24:37,476 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:37,476 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:37,477 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:37,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:37,477 INFO L82 PathProgramCache]: Analyzing trace with hash 28698760, now seen corresponding path program 1 times [2019-11-15 23:24:37,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:37,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851130479] [2019-11-15 23:24:37,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:37,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851130479] [2019-11-15 23:24:37,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:37,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:37,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751412351] [2019-11-15 23:24:37,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:37,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:37,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:37,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:37,622 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-11-15 23:24:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:37,662 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-11-15 23:24:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:37,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-15 23:24:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:37,664 INFO L225 Difference]: With dead ends: 48 [2019-11-15 23:24:37,665 INFO L226 Difference]: Without dead ends: 47 [2019-11-15 23:24:37,666 INFO L600 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-15 23:24:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-15 23:24:37,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-15 23:24:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 23:24:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-15 23:24:37,678 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 5 [2019-11-15 23:24:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:37,679 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-15 23:24:37,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-15 23:24:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 23:24:37,682 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:37,683 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:37,683 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:37,706 INFO L82 PathProgramCache]: Analyzing trace with hash 266305344, now seen corresponding path program 1 times [2019-11-15 23:24:37,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:37,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326061957] [2019-11-15 23:24:37,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:37,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326061957] [2019-11-15 23:24:37,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:37,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:37,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562750496] [2019-11-15 23:24:37,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:37,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:37,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:37,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:37,817 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 3 states. [2019-11-15 23:24:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:37,934 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-11-15 23:24:37,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:37,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-15 23:24:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:37,936 INFO L225 Difference]: With dead ends: 47 [2019-11-15 23:24:37,936 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 23:24:37,937 INFO L600 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-15 23:24:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 23:24:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-15 23:24:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 23:24:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-15 23:24:37,944 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2019-11-15 23:24:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:37,944 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-15 23:24:37,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-15 23:24:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-15 23:24:37,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:37,946 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-11-15 23:24:37,953 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:37,954 INFO L82 PathProgramCache]: Analyzing trace with hash 266307074, now seen corresponding path program 1 times [2019-11-15 23:24:37,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:37,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984917988] [2019-11-15 23:24:37,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:37,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:38,067 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-15 23:24:38,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984917988] [2019-11-15 23:24:38,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:38,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:38,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077312200] [2019-11-15 23:24:38,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:38,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:38,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:38,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:38,070 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2019-11-15 23:24:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:38,099 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-11-15 23:24:38,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:38,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-15 23:24:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:38,101 INFO L225 Difference]: With dead ends: 43 [2019-11-15 23:24:38,101 INFO L226 Difference]: Without dead ends: 42 [2019-11-15 23:24:38,102 INFO L600 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-15 23:24:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-15 23:24:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-15 23:24:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 23:24:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-15 23:24:38,122 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 8 [2019-11-15 23:24:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:38,123 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-15 23:24:38,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-15 23:24:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 23:24:38,124 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:38,124 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:38,125 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:38,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:38,126 INFO L82 PathProgramCache]: Analyzing trace with hash -334468875, now seen corresponding path program 1 times [2019-11-15 23:24:38,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:38,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628283248] [2019-11-15 23:24:38,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:38,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628283248] [2019-11-15 23:24:38,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:38,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:38,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548009673] [2019-11-15 23:24:38,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:38,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:38,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:38,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:38,231 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2019-11-15 23:24:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:38,326 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-15 23:24:38,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:38,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-15 23:24:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:38,328 INFO L225 Difference]: With dead ends: 40 [2019-11-15 23:24:38,328 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 23:24:38,328 INFO L600 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-15 23:24:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 23:24:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-15 23:24:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 23:24:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-15 23:24:38,340 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 9 [2019-11-15 23:24:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:38,341 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-15 23:24:38,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-15 23:24:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:24:38,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:38,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:38,343 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:38,344 INFO L82 PathProgramCache]: Analyzing trace with hash 697960087, now seen corresponding path program 1 times [2019-11-15 23:24:38,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:38,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533212516] [2019-11-15 23:24:38,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:38,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533212516] [2019-11-15 23:24:38,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:38,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:38,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112091405] [2019-11-15 23:24:38,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:38,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:38,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:38,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:38,445 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-11-15 23:24:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:38,523 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-15 23:24:38,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:38,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 23:24:38,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:38,526 INFO L225 Difference]: With dead ends: 38 [2019-11-15 23:24:38,526 INFO L226 Difference]: Without dead ends: 36 [2019-11-15 23:24:38,526 INFO L600 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-15 23:24:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-15 23:24:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-15 23:24:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 23:24:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-15 23:24:38,539 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 11 [2019-11-15 23:24:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:38,540 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-15 23:24:38,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-15 23:24:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:24:38,548 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:38,548 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:38,549 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:38,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash -557684678, now seen corresponding path program 1 times [2019-11-15 23:24:38,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:38,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471160900] [2019-11-15 23:24:38,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:38,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471160900] [2019-11-15 23:24:38,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:38,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:24:38,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119321727] [2019-11-15 23:24:38,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:38,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:38,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:38,643 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 3 states. [2019-11-15 23:24:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:38,702 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-11-15 23:24:38,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:38,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 23:24:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:38,704 INFO L225 Difference]: With dead ends: 60 [2019-11-15 23:24:38,704 INFO L226 Difference]: Without dead ends: 39 [2019-11-15 23:24:38,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-15 23:24:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-15 23:24:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:24:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-15 23:24:38,714 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-11-15 23:24:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:38,715 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-15 23:24:38,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-15 23:24:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:24:38,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:38,716 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:38,717 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:38,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017679, now seen corresponding path program 1 times [2019-11-15 23:24:38,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:38,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642691580] [2019-11-15 23:24:38,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:38,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:38,859 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-15 23:24:38,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642691580] [2019-11-15 23:24:38,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:38,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:24:38,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112241446] [2019-11-15 23:24:38,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:24:38,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:38,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:24:38,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:24:38,861 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2019-11-15 23:24:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:39,002 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-11-15 23:24:39,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:24:39,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-15 23:24:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:39,004 INFO L225 Difference]: With dead ends: 51 [2019-11-15 23:24:39,004 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 23:24:39,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:24:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 23:24:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-11-15 23:24:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 23:24:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-15 23:24:39,010 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-11-15 23:24:39,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:39,010 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-15 23:24:39,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:24:39,010 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-15 23:24:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:24:39,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:39,011 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:39,012 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:39,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:39,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017624, now seen corresponding path program 1 times [2019-11-15 23:24:39,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:39,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559536717] [2019-11-15 23:24:39,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:24:39,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559536717] [2019-11-15 23:24:39,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:39,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:39,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561065673] [2019-11-15 23:24:39,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:39,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:39,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:39,113 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-11-15 23:24:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:39,162 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-15 23:24:39,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:39,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 23:24:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:39,164 INFO L225 Difference]: With dead ends: 38 [2019-11-15 23:24:39,164 INFO L226 Difference]: Without dead ends: 37 [2019-11-15 23:24:39,164 INFO L600 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-15 23:24:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-15 23:24:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-15 23:24:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 23:24:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-15 23:24:39,169 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2019-11-15 23:24:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:39,169 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-15 23:24:39,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-15 23:24:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:24:39,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:39,170 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:39,171 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:39,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:39,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1840190412, now seen corresponding path program 1 times [2019-11-15 23:24:39,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:39,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439284894] [2019-11-15 23:24:39,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:39,284 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-15 23:24:39,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439284894] [2019-11-15 23:24:39,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:39,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:39,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881334769] [2019-11-15 23:24:39,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:39,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:39,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:39,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:39,286 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 3 states. [2019-11-15 23:24:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:39,357 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-11-15 23:24:39,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:39,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:24:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:39,359 INFO L225 Difference]: With dead ends: 59 [2019-11-15 23:24:39,359 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 23:24:39,359 INFO L600 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-15 23:24:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 23:24:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-11-15 23:24:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 23:24:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-11-15 23:24:39,365 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2019-11-15 23:24:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:39,369 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-11-15 23:24:39,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-11-15 23:24:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:24:39,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:39,370 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:39,371 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:39,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1840192110, now seen corresponding path program 1 times [2019-11-15 23:24:39,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:39,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599351172] [2019-11-15 23:24:39,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:39,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599351172] [2019-11-15 23:24:39,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:39,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:39,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497201482] [2019-11-15 23:24:39,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:39,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:39,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:39,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:39,458 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 3 states. [2019-11-15 23:24:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:39,487 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-11-15 23:24:39,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:39,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-15 23:24:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:39,489 INFO L225 Difference]: With dead ends: 57 [2019-11-15 23:24:39,489 INFO L226 Difference]: Without dead ends: 56 [2019-11-15 23:24:39,489 INFO L600 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-15 23:24:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-15 23:24:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2019-11-15 23:24:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 23:24:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-11-15 23:24:39,495 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 22 [2019-11-15 23:24:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:39,496 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-11-15 23:24:39,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-11-15 23:24:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:24:39,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:39,498 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:39,498 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:39,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:39,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2077877290, now seen corresponding path program 1 times [2019-11-15 23:24:39,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:39,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694322437] [2019-11-15 23:24:39,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:39,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694322437] [2019-11-15 23:24:39,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:39,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:24:39,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189040388] [2019-11-15 23:24:39,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:24:39,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:39,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:24:39,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:24:39,621 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2019-11-15 23:24:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:39,777 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-11-15 23:24:39,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:24:39,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 23:24:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:39,779 INFO L225 Difference]: With dead ends: 42 [2019-11-15 23:24:39,779 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 23:24:39,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:24:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 23:24:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-15 23:24:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 23:24:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-11-15 23:24:39,784 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 24 [2019-11-15 23:24:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:39,785 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-11-15 23:24:39,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:24:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-11-15 23:24:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:24:39,793 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:39,793 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:39,794 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:39,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:39,795 INFO L82 PathProgramCache]: Analyzing trace with hash 10313574, now seen corresponding path program 1 times [2019-11-15 23:24:39,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:39,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850896150] [2019-11-15 23:24:39,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:39,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850896150] [2019-11-15 23:24:39,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:39,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:39,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880164832] [2019-11-15 23:24:39,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:39,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:39,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:39,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:39,891 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2019-11-15 23:24:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:39,928 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-11-15 23:24:39,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:39,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-15 23:24:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:39,929 INFO L225 Difference]: With dead ends: 44 [2019-11-15 23:24:39,930 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 23:24:39,930 INFO L600 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-15 23:24:39,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 23:24:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-15 23:24:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 23:24:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-11-15 23:24:39,942 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2019-11-15 23:24:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:39,942 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-11-15 23:24:39,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-11-15 23:24:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:24:39,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:39,944 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:39,944 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:39,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1985844013, now seen corresponding path program 1 times [2019-11-15 23:24:39,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:39,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854493042] [2019-11-15 23:24:39,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:39,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:24:40,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854493042] [2019-11-15 23:24:40,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:40,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:40,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752155811] [2019-11-15 23:24:40,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:40,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:40,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:40,017 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2019-11-15 23:24:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:40,041 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-11-15 23:24:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:40,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-15 23:24:40,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:40,043 INFO L225 Difference]: With dead ends: 43 [2019-11-15 23:24:40,043 INFO L226 Difference]: Without dead ends: 30 [2019-11-15 23:24:40,044 INFO L600 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-15 23:24:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-15 23:24:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-15 23:24:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:24:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-15 23:24:40,047 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 28 [2019-11-15 23:24:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:40,048 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-15 23:24:40,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-15 23:24:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:24:40,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:24:40,049 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:24:40,053 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-15 23:24:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1042497349, now seen corresponding path program 1 times [2019-11-15 23:24:40,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:40,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409414269] [2019-11-15 23:24:40,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:40,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:40,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:24:40,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409414269] [2019-11-15 23:24:40,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:24:40,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:24:40,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911355952] [2019-11-15 23:24:40,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:24:40,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:24:40,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:24:40,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:24:40,153 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2019-11-15 23:24:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:24:40,194 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-11-15 23:24:40,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:24:40,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 23:24:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:24:40,195 INFO L225 Difference]: With dead ends: 30 [2019-11-15 23:24:40,195 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:24:40,196 INFO L600 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-15 23:24:40,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:24:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:24:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:24:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:24:40,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-15 23:24:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:24:40,197 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:24:40,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:24:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:24:40,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:24:40,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:24:40,639 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2019-11-15 23:24:40,924 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-11-15 23:24:41,020 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-11-15 23:24:41,020 INFO L439 ceAbstractionStarter]: At program point L1761(lines 1757 1762) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-11-15 23:24:41,021 INFO L446 ceAbstractionStarter]: At program point L1889(lines 1861 1890) the Hoare annotation is: true [2019-11-15 23:24:41,021 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-15 23:24:41,021 INFO L443 ceAbstractionStarter]: For program point L1873(line 1873) no Hoare annotation was computed. [2019-11-15 23:24:41,021 INFO L443 ceAbstractionStarter]: For program point L1873-1(line 1873) no Hoare annotation was computed. [2019-11-15 23:24:41,021 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-11-15 23:24:41,021 INFO L443 ceAbstractionStarter]: For program point L1873-2(line 1873) no Hoare annotation was computed. [2019-11-15 23:24:41,021 INFO L443 ceAbstractionStarter]: For program point L1873-3(line 1873) no Hoare annotation was computed. [2019-11-15 23:24:41,021 INFO L443 ceAbstractionStarter]: For program point L1865-2(lines 1865 1866) no Hoare annotation was computed. [2019-11-15 23:24:41,022 INFO L443 ceAbstractionStarter]: For program point L1865-3(line 1865) no Hoare annotation was computed. [2019-11-15 23:24:41,022 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-15 23:24:41,022 INFO L439 ceAbstractionStarter]: At program point L1865-4(lines 1865 1866) the Hoare annotation is: (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648)) [2019-11-15 23:24:41,022 INFO L443 ceAbstractionStarter]: For program point L1865-5(lines 1865 1866) no Hoare annotation was computed. [2019-11-15 23:24:41,022 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:24:41,022 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:24:41,022 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:24:41,022 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-15 23:24:41,023 INFO L439 ceAbstractionStarter]: At program point L1779(lines 1777 1780) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-11-15 23:24:41,023 INFO L439 ceAbstractionStarter]: At program point L1775(lines 1766 1776) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-11-15 23:24:41,023 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-11-15 23:24:41,023 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-15 23:24:41,023 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-11-15 23:24:41,023 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:24:41,023 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-15 23:24:41,024 INFO L443 ceAbstractionStarter]: For program point L1875-2(lines 1875 1882) no Hoare annotation was computed. [2019-11-15 23:24:41,024 INFO L443 ceAbstractionStarter]: For program point L1875-3(line 1875) no Hoare annotation was computed. [2019-11-15 23:24:41,024 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-11-15 23:24:41,024 INFO L439 ceAbstractionStarter]: At program point L1875-4(lines 1875 1882) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~argc~0)) (.cse1 (<= ULTIMATE.start_main_~argc~0 10000)) (.cse2 (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~i~4 0)) (and (<= 0 (+ ULTIMATE.start_main_~j~0 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~4 2147483648)) .cse0 .cse1 .cse2))) [2019-11-15 23:24:41,024 INFO L443 ceAbstractionStarter]: For program point L1875-5(lines 1875 1882) no Hoare annotation was computed. [2019-11-15 23:24:41,024 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-15 23:24:41,024 INFO L443 ceAbstractionStarter]: For program point L1768(lines 1768 1769) no Hoare annotation was computed. [2019-11-15 23:24:41,025 INFO L443 ceAbstractionStarter]: For program point L1768-1(lines 1768 1769) no Hoare annotation was computed. [2019-11-15 23:24:41,025 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-11-15 23:24:41,025 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-15 23:24:41,025 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-11-15 23:24:41,025 INFO L443 ceAbstractionStarter]: For program point L1884-2(lines 1884 1885) no Hoare annotation was computed. [2019-11-15 23:24:41,028 INFO L443 ceAbstractionStarter]: For program point L1884-3(line 1884) no Hoare annotation was computed. [2019-11-15 23:24:41,029 INFO L439 ceAbstractionStarter]: At program point L1884-4(lines 1884 1885) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~5 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-11-15 23:24:41,029 INFO L443 ceAbstractionStarter]: For program point L1884-5(lines 1884 1885) no Hoare annotation was computed. [2019-11-15 23:24:41,029 INFO L443 ceAbstractionStarter]: For program point L1880-2(lines 1880 1881) no Hoare annotation was computed. [2019-11-15 23:24:41,029 INFO L443 ceAbstractionStarter]: For program point L1880-3(line 1880) no Hoare annotation was computed. [2019-11-15 23:24:41,030 INFO L439 ceAbstractionStarter]: At program point L1880-4(lines 1880 1881) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~4 9999) (<= 0 (+ ULTIMATE.start_main_~j~0 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~4 2147483648)) (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-11-15 23:24:41,031 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-11-15 23:24:41,032 INFO L443 ceAbstractionStarter]: For program point L1872(line 1872) no Hoare annotation was computed. [2019-11-15 23:24:41,032 INFO L443 ceAbstractionStarter]: For program point L1872-1(line 1872) no Hoare annotation was computed. [2019-11-15 23:24:41,032 INFO L443 ceAbstractionStarter]: For program point L1872-2(line 1872) no Hoare annotation was computed. [2019-11-15 23:24:41,032 INFO L443 ceAbstractionStarter]: For program point L1872-3(line 1872) no Hoare annotation was computed. [2019-11-15 23:24:41,035 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-15 23:24:41,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:24:41 BoogieIcfgContainer [2019-11-15 23:24:41,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:24:41,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:24:41,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:24:41,072 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:24:41,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:36" (3/4) ... [2019-11-15 23:24:41,078 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:24:41,097 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-15 23:24:41,097 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-15 23:24:41,098 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:24:41,217 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b84e940c-ab57-48b9-b07b-3910074a6714/bin/uautomizer/witness.graphml [2019-11-15 23:24:41,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:24:41,219 INFO L168 Benchmark]: Toolchain (without parser) took 7641.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -205.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:24:41,220 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:24:41,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1813.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.7 MB in the beginning and 979.3 MB in the end (delta: -34.6 MB). Peak memory consumption was 126.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:41,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.11 ms. Allocated memory is still 1.2 GB. Free memory is still 979.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:24:41,221 INFO L168 Benchmark]: Boogie Preprocessor took 93.13 ms. Allocated memory is still 1.2 GB. Free memory was 979.3 MB in the beginning and 973.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:41,222 INFO L168 Benchmark]: RCFGBuilder took 1160.95 ms. Allocated memory is still 1.2 GB. Free memory was 973.9 MB in the beginning and 930.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:41,222 INFO L168 Benchmark]: TraceAbstraction took 4284.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 930.1 MB in the beginning and 1.2 GB in the end (delta: -228.0 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:41,223 INFO L168 Benchmark]: Witness Printer took 146.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:41,225 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1813.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.7 MB in the beginning and 979.3 MB in the end (delta: -34.6 MB). Peak memory consumption was 126.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 138.11 ms. Allocated memory is still 1.2 GB. Free memory is still 979.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.13 ms. Allocated memory is still 1.2 GB. Free memory was 979.3 MB in the beginning and 973.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1160.95 ms. Allocated memory is still 1.2 GB. Free memory was 973.9 MB in the beginning and 930.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4284.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 930.1 MB in the beginning and 1.2 GB in the end (delta: -228.0 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. * Witness Printer took 146.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1880]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1880]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1884]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1884]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 1777]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1880]: Loop Invariant Derived loop invariant: ((((i <= 9999 && 0 <= j + 2147483648) && 0 <= i + 2147483648) && argc <= 10000) && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1884]: Loop Invariant Derived loop invariant: ((argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648) && 0 <= i + 2147483648 - InvariantResult [Line: 1757]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1861]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1766]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1875]: Loop Invariant Derived loop invariant: (((1 <= argc && argc <= 10000) && 0 <= i + 2147483648) && i == 0) || ((((0 <= j + 2147483648 && 0 <= i + 2147483648) && 1 <= argc) && argc <= 10000) && 0 <= i + 2147483648) - InvariantResult [Line: 1865]: Loop Invariant Derived loop invariant: 0 <= i + 2147483648 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 16 error locations. Result: SAFE, OverallTime: 4.1s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 484 SDtfs, 241 SDslu, 337 SDs, 0 SdLazy, 172 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 21 NumberOfFragments, 123 HoareAnnotationTreeSize, 8 FomulaSimplifications, 1073 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 166 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 8362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 36/36 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...