./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-2e94e6a [2019-01-01 21:17:54,510 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:17:54,513 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:17:54,534 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:17:54,535 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:17:54,537 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:17:54,539 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:17:54,542 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:17:54,546 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:17:54,548 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:17:54,551 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:17:54,552 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:17:54,553 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:17:54,556 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:17:54,557 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:17:54,563 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:17:54,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:17:54,570 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:17:54,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:17:54,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:17:54,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:17:54,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:17:54,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:17:54,592 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:17:54,593 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:17:54,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:17:54,596 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:17:54,599 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:17:54,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:17:54,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:17:54,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:17:54,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:17:54,608 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:17:54,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:17:54,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:17:54,612 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:17:54,613 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 21:17:54,642 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:17:54,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:17:54,644 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:17:54,645 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:17:54,645 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:17:54,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:17:54,646 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:17:54,647 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:17:54,647 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:17:54,647 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 21:17:54,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 21:17:54,648 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 21:17:54,648 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 21:17:54,648 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:17:54,648 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:17:54,649 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 21:17:54,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:17:54,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:17:54,650 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 21:17:54,650 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 21:17:54,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 21:17:54,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:17:54,650 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 21:17:54,650 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 21:17:54,652 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:17:54,652 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 21:17:54,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 21:17:54,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-01-01 21:17:54,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:17:54,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:17:54,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:17:54,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:17:54,761 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:17:54,762 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.i [2019-01-01 21:17:54,837 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed084a503/c0adc33b8b624eba8641e21b0b6a0e8b/FLAGfafb15ddb [2019-01-01 21:17:55,526 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:17:55,527 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.i [2019-01-01 21:17:55,565 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed084a503/c0adc33b8b624eba8641e21b0b6a0e8b/FLAGfafb15ddb [2019-01-01 21:17:55,664 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed084a503/c0adc33b8b624eba8641e21b0b6a0e8b [2019-01-01 21:17:55,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:17:55,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:17:55,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:17:55,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:17:55,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:17:55,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:17:55" (1/1) ... [2019-01-01 21:17:55,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486e9ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:55, skipping insertion in model container [2019-01-01 21:17:55,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:17:55" (1/1) ... [2019-01-01 21:17:55,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:17:55,769 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:17:56,878 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:17:57,043 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:17:57,179 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:17:57,714 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:17:57,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57 WrapperNode [2019-01-01 21:17:57,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:17:57,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:17:57,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:17:57,717 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:17:57,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57" (1/1) ... [2019-01-01 21:17:57,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57" (1/1) ... [2019-01-01 21:17:57,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:17:57,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:17:57,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:17:57,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:17:57,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57" (1/1) ... [2019-01-01 21:17:57,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57" (1/1) ... [2019-01-01 21:17:57,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57" (1/1) ... [2019-01-01 21:17:57,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57" (1/1) ... [2019-01-01 21:17:57,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57" (1/1) ... [2019-01-01 21:17:57,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57" (1/1) ... [2019-01-01 21:17:57,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57" (1/1) ... [2019-01-01 21:17:57,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:17:57,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:17:57,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:17:57,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:17:57,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-01 21:17:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:17:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 21:17:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-01-01 21:17:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 21:17:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:17:57,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:17:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:17:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 21:17:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:17:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 21:17:59,057 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:17:59,058 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-01 21:17:59,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:17:59 BoogieIcfgContainer [2019-01-01 21:17:59,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:17:59,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 21:17:59,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 21:17:59,064 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 21:17:59,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 09:17:55" (1/3) ... [2019-01-01 21:17:59,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671f74f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:17:59, skipping insertion in model container [2019-01-01 21:17:59,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:17:57" (2/3) ... [2019-01-01 21:17:59,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671f74f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:17:59, skipping insertion in model container [2019-01-01 21:17:59,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:17:59" (3/3) ... [2019-01-01 21:17:59,068 INFO L112 eAbstractionObserver]: Analyzing ICFG hostid_true-no-overflow_true-valid-memsafety.i [2019-01-01 21:17:59,078 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 21:17:59,087 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-01-01 21:17:59,108 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-01-01 21:17:59,141 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:17:59,142 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 21:17:59,142 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 21:17:59,142 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 21:17:59,143 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:17:59,143 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:17:59,143 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 21:17:59,143 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:17:59,143 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 21:17:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-01-01 21:17:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 21:17:59,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:17:59,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 21:17:59,171 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:17:59,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:17:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-01 21:17:59,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:17:59,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:17:59,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:17:59,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:17:59,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:17:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:17:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:17:59,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:17:59,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:17:59,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:17:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:17:59,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:17:59,645 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-01-01 21:17:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:17:59,729 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2019-01-01 21:17:59,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:17:59,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-01 21:17:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:17:59,741 INFO L225 Difference]: With dead ends: 92 [2019-01-01 21:17:59,741 INFO L226 Difference]: Without dead ends: 45 [2019-01-01 21:17:59,745 INFO L631 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-01-01 21:17:59,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-01 21:17:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-01 21:17:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 21:17:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-01-01 21:17:59,784 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2019-01-01 21:17:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:17:59,785 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-01-01 21:17:59,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:17:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-01-01 21:17:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 21:17:59,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:17:59,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 21:17:59,786 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:17:59,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:17:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash 28698760, now seen corresponding path program 1 times [2019-01-01 21:17:59,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:17:59,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:17:59,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:17:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:17:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:17:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:17:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:17:59,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:17:59,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:17:59,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:17:59,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:17:59,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:17:59,960 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-01-01 21:18:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:00,028 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-01-01 21:18:00,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:00,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 21:18:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:00,031 INFO L225 Difference]: With dead ends: 48 [2019-01-01 21:18:00,032 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 21:18:00,034 INFO L631 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-01-01 21:18:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 21:18:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-01 21:18:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 21:18:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-01-01 21:18:00,041 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 5 [2019-01-01 21:18:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:00,042 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-01-01 21:18:00,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-01-01 21:18:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 21:18:00,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:00,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:18:00,044 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:00,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:00,044 INFO L82 PathProgramCache]: Analyzing trace with hash 266305344, now seen corresponding path program 1 times [2019-01-01 21:18:00,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:00,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:00,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:00,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:00,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:18:00,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:00,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:18:00,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:18:00,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:18:00,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:18:00,174 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 3 states. [2019-01-01 21:18:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:00,303 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-01-01 21:18:00,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:00,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-01 21:18:00,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:00,305 INFO L225 Difference]: With dead ends: 47 [2019-01-01 21:18:00,305 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 21:18:00,306 INFO L631 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-01-01 21:18:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 21:18:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-01 21:18:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 21:18:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-01-01 21:18:00,312 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2019-01-01 21:18:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:00,313 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-01-01 21:18:00,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-01-01 21:18:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 21:18:00,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:00,313 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-01 21:18:00,314 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:00,314 INFO L82 PathProgramCache]: Analyzing trace with hash 266307074, now seen corresponding path program 1 times [2019-01-01 21:18:00,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:00,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:00,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:00,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:00,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:18:00,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:00,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:18:00,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:18:00,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:18:00,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:18:00,437 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2019-01-01 21:18:00,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:00,518 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-01-01 21:18:00,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:00,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-01 21:18:00,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:00,520 INFO L225 Difference]: With dead ends: 43 [2019-01-01 21:18:00,520 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 21:18:00,520 INFO L631 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-01-01 21:18:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 21:18:00,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-01-01 21:18:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 21:18:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-01 21:18:00,534 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 8 [2019-01-01 21:18:00,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:00,534 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-01 21:18:00,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-01 21:18:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 21:18:00,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:00,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:18:00,539 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:00,540 INFO L82 PathProgramCache]: Analyzing trace with hash -334468875, now seen corresponding path program 1 times [2019-01-01 21:18:00,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:00,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:00,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:00,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:00,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:18:00,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:00,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:18:00,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:18:00,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:18:00,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:18:00,691 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2019-01-01 21:18:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:00,836 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-01 21:18:00,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:00,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-01 21:18:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:00,837 INFO L225 Difference]: With dead ends: 40 [2019-01-01 21:18:00,837 INFO L226 Difference]: Without dead ends: 38 [2019-01-01 21:18:00,838 INFO L631 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-01-01 21:18:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-01 21:18:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-01 21:18:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 21:18:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-01-01 21:18:00,847 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 9 [2019-01-01 21:18:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:00,847 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-01-01 21:18:00,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-01-01 21:18:00,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 21:18:00,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:00,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:18:00,853 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:00,857 INFO L82 PathProgramCache]: Analyzing trace with hash 697960087, now seen corresponding path program 1 times [2019-01-01 21:18:00,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:00,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:00,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:00,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:00,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:18:00,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:00,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:18:00,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:18:00,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:18:00,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:18:00,985 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-01-01 21:18:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:01,208 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-01-01 21:18:01,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:01,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-01 21:18:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:01,210 INFO L225 Difference]: With dead ends: 38 [2019-01-01 21:18:01,210 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 21:18:01,211 INFO L631 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-01-01 21:18:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 21:18:01,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-01 21:18:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 21:18:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-01-01 21:18:01,218 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 11 [2019-01-01 21:18:01,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:01,219 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-01 21:18:01,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-01-01 21:18:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 21:18:01,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:01,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:18:01,222 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:01,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:01,223 INFO L82 PathProgramCache]: Analyzing trace with hash -557684678, now seen corresponding path program 1 times [2019-01-01 21:18:01,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:01,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:01,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:01,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:01,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:01,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:18:01,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:01,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:18:01,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:18:01,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:18:01,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:18:01,363 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 3 states. [2019-01-01 21:18:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:01,500 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-01-01 21:18:01,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:01,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-01 21:18:01,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:01,505 INFO L225 Difference]: With dead ends: 60 [2019-01-01 21:18:01,505 INFO L226 Difference]: Without dead ends: 39 [2019-01-01 21:18:01,506 INFO L631 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-01-01 21:18:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-01 21:18:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-01 21:18:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 21:18:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-01 21:18:01,514 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-01-01 21:18:01,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:01,515 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-01 21:18:01,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-01 21:18:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 21:18:01,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:01,516 INFO L402 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-01-01 21:18:01,519 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:01,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:01,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017679, now seen corresponding path program 1 times [2019-01-01 21:18:01,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:01,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:01,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:01,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:01,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:18:01,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:01,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:18:01,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 21:18:01,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:18:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:18:01,792 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2019-01-01 21:18:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:02,127 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-01-01 21:18:02,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:18:02,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-01-01 21:18:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:02,128 INFO L225 Difference]: With dead ends: 51 [2019-01-01 21:18:02,128 INFO L226 Difference]: Without dead ends: 50 [2019-01-01 21:18:02,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:18:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-01 21:18:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-01-01 21:18:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 21:18:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-01-01 21:18:02,135 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-01-01 21:18:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:02,135 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-01-01 21:18:02,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 21:18:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-01-01 21:18:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 21:18:02,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:02,138 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:18:02,139 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:02,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:02,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017624, now seen corresponding path program 1 times [2019-01-01 21:18:02,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:02,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:02,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:02,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:02,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:18:02,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:02,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:18:02,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:18:02,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:18:02,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:18:02,250 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-01-01 21:18:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:02,381 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-01-01 21:18:02,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:02,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-01 21:18:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:02,383 INFO L225 Difference]: With dead ends: 38 [2019-01-01 21:18:02,385 INFO L226 Difference]: Without dead ends: 37 [2019-01-01 21:18:02,386 INFO L631 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-01-01 21:18:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-01 21:18:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-01 21:18:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 21:18:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-01-01 21:18:02,392 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2019-01-01 21:18:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:02,392 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-01 21:18:02,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-01-01 21:18:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 21:18:02,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:02,395 INFO L402 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-01-01 21:18:02,395 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:02,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1840190412, now seen corresponding path program 1 times [2019-01-01 21:18:02,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:02,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:02,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:02,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:02,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:18:02,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:02,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:18:02,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:18:02,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:18:02,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:18:02,512 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 3 states. [2019-01-01 21:18:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:02,682 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-01-01 21:18:02,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:02,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-01 21:18:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:02,685 INFO L225 Difference]: With dead ends: 59 [2019-01-01 21:18:02,685 INFO L226 Difference]: Without dead ends: 58 [2019-01-01 21:18:02,685 INFO L631 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-01-01 21:18:02,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-01 21:18:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-01-01 21:18:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 21:18:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-01-01 21:18:02,695 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2019-01-01 21:18:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:02,695 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-01-01 21:18:02,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-01-01 21:18:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 21:18:02,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:02,698 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:18:02,699 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:02,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1840192110, now seen corresponding path program 1 times [2019-01-01 21:18:02,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:02,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:02,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:02,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:02,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:18:02,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:02,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:18:02,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:18:02,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:18:02,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:18:02,822 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 3 states. [2019-01-01 21:18:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:02,925 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-01-01 21:18:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:02,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-01 21:18:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:02,929 INFO L225 Difference]: With dead ends: 57 [2019-01-01 21:18:02,932 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 21:18:02,932 INFO L631 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-01-01 21:18:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 21:18:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2019-01-01 21:18:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 21:18:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-01 21:18:02,944 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 22 [2019-01-01 21:18:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:02,945 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-01 21:18:02,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-01 21:18:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 21:18:02,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:02,946 INFO L402 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-01-01 21:18:02,946 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:02,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:02,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2077877290, now seen corresponding path program 1 times [2019-01-01 21:18:02,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:02,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:02,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:02,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:02,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:18:03,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:03,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:18:03,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 21:18:03,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:18:03,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:18:03,191 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2019-01-01 21:18:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:03,622 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-01-01 21:18:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:18:03,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-01-01 21:18:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:03,624 INFO L225 Difference]: With dead ends: 42 [2019-01-01 21:18:03,624 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 21:18:03,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:18:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 21:18:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-01 21:18:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 21:18:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-01-01 21:18:03,631 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 24 [2019-01-01 21:18:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:03,631 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-01 21:18:03,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 21:18:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-01-01 21:18:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 21:18:03,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:03,635 INFO L402 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-01-01 21:18:03,635 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:03,636 INFO L82 PathProgramCache]: Analyzing trace with hash 10313574, now seen corresponding path program 1 times [2019-01-01 21:18:03,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:03,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:03,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:03,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:03,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:18:03,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:03,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:18:03,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:18:03,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:18:03,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:18:03,761 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2019-01-01 21:18:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:03,870 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-01-01 21:18:03,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:03,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-01 21:18:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:03,873 INFO L225 Difference]: With dead ends: 44 [2019-01-01 21:18:03,873 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 21:18:03,873 INFO L631 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-01-01 21:18:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 21:18:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-01 21:18:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 21:18:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-01 21:18:03,895 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2019-01-01 21:18:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:03,901 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-01 21:18:03,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-01 21:18:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 21:18:03,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:03,903 INFO L402 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-01-01 21:18:03,903 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:03,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:03,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1985844013, now seen corresponding path program 1 times [2019-01-01 21:18:03,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:03,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:03,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:03,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:03,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:18:04,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:04,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:18:04,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:18:04,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:18:04,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:18:04,045 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2019-01-01 21:18:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:04,125 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-01-01 21:18:04,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:04,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-01 21:18:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:04,127 INFO L225 Difference]: With dead ends: 43 [2019-01-01 21:18:04,127 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 21:18:04,128 INFO L631 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-01-01 21:18:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 21:18:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-01 21:18:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 21:18:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-01 21:18:04,140 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 28 [2019-01-01 21:18:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:04,140 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-01 21:18:04,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-01 21:18:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 21:18:04,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:18:04,144 INFO L402 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-01-01 21:18:04,145 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:18:04,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:18:04,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1042497349, now seen corresponding path program 1 times [2019-01-01 21:18:04,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:18:04,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:18:04,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:04,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:18:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:18:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:18:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 21:18:04,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:18:04,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:18:04,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:18:04,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:18:04,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:18:04,283 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2019-01-01 21:18:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:18:04,377 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-01-01 21:18:04,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:18:04,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-01 21:18:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:18:04,379 INFO L225 Difference]: With dead ends: 30 [2019-01-01 21:18:04,379 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 21:18:04,379 INFO L631 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-01-01 21:18:04,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 21:18:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 21:18:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 21:18:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:18:04,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-01-01 21:18:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:18:04,380 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:18:04,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:18:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:18:04,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 21:18:04,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 21:18:04,613 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-01 21:18:04,883 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-01-01 21:18:05,172 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2019-01-01 21:18:05,455 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-01 21:18:05,534 INFO L444 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-01-01 21:18:05,535 INFO L451 ceAbstractionStarter]: At program point L1889(lines 1861 1890) the Hoare annotation is: true [2019-01-01 21:18:05,535 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-01-01 21:18:05,535 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-01-01 21:18:05,535 INFO L448 ceAbstractionStarter]: For program point L1873(line 1873) no Hoare annotation was computed. [2019-01-01 21:18:05,535 INFO L448 ceAbstractionStarter]: For program point L1873-1(line 1873) no Hoare annotation was computed. [2019-01-01 21:18:05,536 INFO L448 ceAbstractionStarter]: For program point L1873-2(line 1873) no Hoare annotation was computed. [2019-01-01 21:18:05,536 INFO L448 ceAbstractionStarter]: For program point L1873-3(line 1873) no Hoare annotation was computed. [2019-01-01 21:18:05,536 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-01-01 21:18:05,536 INFO L448 ceAbstractionStarter]: For program point L1865-2(lines 1865 1866) no Hoare annotation was computed. [2019-01-01 21:18:05,536 INFO L448 ceAbstractionStarter]: For program point L1865-3(line 1865) no Hoare annotation was computed. [2019-01-01 21:18:05,536 INFO L444 ceAbstractionStarter]: At program point L1865-4(lines 1865 1866) the Hoare annotation is: (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648)) [2019-01-01 21:18:05,537 INFO L448 ceAbstractionStarter]: For program point L1865-5(lines 1865 1866) no Hoare annotation was computed. [2019-01-01 21:18:05,537 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-01-01 21:18:05,537 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-01 21:18:05,537 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 21:18:05,537 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 21:18:05,537 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-01-01 21:18:05,537 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-01-01 21:18:05,537 INFO L444 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-01-01 21:18:05,538 INFO L444 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-01-01 21:18:05,538 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 21:18:05,538 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-01-01 21:18:05,538 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-01-01 21:18:05,538 INFO L448 ceAbstractionStarter]: For program point L1875-2(lines 1875 1882) no Hoare annotation was computed. [2019-01-01 21:18:05,538 INFO L448 ceAbstractionStarter]: For program point L1875-3(line 1875) no Hoare annotation was computed. [2019-01-01 21:18:05,538 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-01-01 21:18:05,538 INFO L444 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-01-01 21:18:05,538 INFO L448 ceAbstractionStarter]: For program point L1875-5(lines 1875 1882) no Hoare annotation was computed. [2019-01-01 21:18:05,539 INFO L448 ceAbstractionStarter]: For program point L1768(lines 1768 1769) no Hoare annotation was computed. [2019-01-01 21:18:05,539 INFO L448 ceAbstractionStarter]: For program point L1768-1(lines 1768 1769) no Hoare annotation was computed. [2019-01-01 21:18:05,539 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-01-01 21:18:05,539 INFO L448 ceAbstractionStarter]: For program point L1884-2(lines 1884 1885) no Hoare annotation was computed. [2019-01-01 21:18:05,539 INFO L448 ceAbstractionStarter]: For program point L1884-3(line 1884) no Hoare annotation was computed. [2019-01-01 21:18:05,539 INFO L444 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-01-01 21:18:05,539 INFO L448 ceAbstractionStarter]: For program point L1884-5(lines 1884 1885) no Hoare annotation was computed. [2019-01-01 21:18:05,539 INFO L448 ceAbstractionStarter]: For program point L1880-2(lines 1880 1881) no Hoare annotation was computed. [2019-01-01 21:18:05,539 INFO L448 ceAbstractionStarter]: For program point L1880-3(line 1880) no Hoare annotation was computed. [2019-01-01 21:18:05,540 INFO L444 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-01-01 21:18:05,540 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-01-01 21:18:05,540 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-01-01 21:18:05,540 INFO L448 ceAbstractionStarter]: For program point L1872(line 1872) no Hoare annotation was computed. [2019-01-01 21:18:05,540 INFO L448 ceAbstractionStarter]: For program point L1872-1(line 1872) no Hoare annotation was computed. [2019-01-01 21:18:05,540 INFO L448 ceAbstractionStarter]: For program point L1872-2(line 1872) no Hoare annotation was computed. [2019-01-01 21:18:05,540 INFO L448 ceAbstractionStarter]: For program point L1872-3(line 1872) no Hoare annotation was computed. [2019-01-01 21:18:05,540 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-01-01 21:18:05,541 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-01-01 21:18:05,541 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-01-01 21:18:05,541 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-01-01 21:18:05,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 09:18:05 BoogieIcfgContainer [2019-01-01 21:18:05,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 21:18:05,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:18:05,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:18:05,572 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:18:05,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:17:59" (3/4) ... [2019-01-01 21:18:05,584 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 21:18:05,600 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-01 21:18:05,600 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-01 21:18:05,601 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 21:18:05,681 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:18:05,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:18:05,683 INFO L168 Benchmark]: Toolchain (without parser) took 10013.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 944.5 MB in the beginning and 997.0 MB in the end (delta: -52.5 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:18:05,684 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:18:05,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2044.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 944.5 MB in the beginning and 960.6 MB in the end (delta: -16.1 MB). Peak memory consumption was 120.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:18:05,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.84 ms. Allocated memory is still 1.2 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:18:05,686 INFO L168 Benchmark]: Boogie Preprocessor took 88.55 ms. Allocated memory is still 1.2 GB. Free memory was 960.6 MB in the beginning and 953.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:18:05,686 INFO L168 Benchmark]: RCFGBuilder took 1157.07 ms. Allocated memory is still 1.2 GB. Free memory was 953.7 MB in the beginning and 914.6 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:18:05,688 INFO L168 Benchmark]: TraceAbstraction took 6507.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 914.6 MB in the beginning and 997.0 MB in the end (delta: -82.4 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:18:05,689 INFO L168 Benchmark]: Witness Printer took 112.70 ms. Allocated memory is still 1.2 GB. Free memory is still 997.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:18:05,693 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 2044.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 944.5 MB in the beginning and 960.6 MB in the end (delta: -16.1 MB). Peak memory consumption was 120.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.84 ms. Allocated memory is still 1.2 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.55 ms. Allocated memory is still 1.2 GB. Free memory was 960.6 MB in the beginning and 953.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1157.07 ms. Allocated memory is still 1.2 GB. Free memory was 953.7 MB in the beginning and 914.6 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6507.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 914.6 MB in the beginning and 997.0 MB in the end (delta: -82.4 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. * Witness Printer took 112.70 ms. Allocated memory is still 1.2 GB. Free memory is still 997.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 1872]: 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: 1875]: 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: 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: 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: 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: 1873]: 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: 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 - 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. SAFE Result, 6.4s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 484 SDtfs, 241 SDslu, 337 SDs, 0 SdLazy, 172 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 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, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...