./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4f493a0ec5685991b86ced08697f863f174636a1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:07:28,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:07:28,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:07:28,652 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:07:28,653 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:07:28,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:07:28,654 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:07:28,655 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:07:28,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:07:28,657 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:07:28,658 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:07:28,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:07:28,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:07:28,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:07:28,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:07:28,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:07:28,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:07:28,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:07:28,664 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:07:28,665 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:07:28,666 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:07:28,667 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:07:28,668 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:07:28,668 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:07:28,668 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:07:28,669 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:07:28,669 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:07:28,669 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:07:28,670 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:07:28,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:07:28,670 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:07:28,671 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:07:28,671 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:07:28,671 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:07:28,671 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:07:28,672 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:07:28,672 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-22 22:07:28,679 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:07:28,679 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:07:28,679 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:07:28,680 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:07:28,680 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:07:28,680 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:07:28,680 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:07:28,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:07:28,681 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:07:28,681 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:07:28,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:07:28,681 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:07:28,681 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:07:28,681 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:07:28,681 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-22 22:07:28,682 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:07:28,682 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:07:28,682 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:07:28,682 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:07:28,682 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:07:28,682 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:07:28,683 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:07:28,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:07:28,683 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:07:28,683 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:07:28,683 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:07:28,683 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:07:28,683 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:07:28,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:07:28,684 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f493a0ec5685991b86ced08697f863f174636a1 [2018-11-22 22:07:28,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:07:28,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:07:28,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:07:28,722 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:07:28,722 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:07:28,723 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop_false-no-overflow.c [2018-11-22 22:07:28,765 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/data/7679148be/f9da9a9d2ac44b5ca3a84b5fd5fbce7d/FLAG5548340f5 [2018-11-22 22:07:29,104 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:07:29,105 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop_false-no-overflow.c [2018-11-22 22:07:29,111 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/data/7679148be/f9da9a9d2ac44b5ca3a84b5fd5fbce7d/FLAG5548340f5 [2018-11-22 22:07:29,530 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/data/7679148be/f9da9a9d2ac44b5ca3a84b5fd5fbce7d [2018-11-22 22:07:29,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:07:29,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:07:29,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:07:29,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:07:29,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:07:29,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:07:29" (1/1) ... [2018-11-22 22:07:29,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277df2b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29, skipping insertion in model container [2018-11-22 22:07:29,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:07:29" (1/1) ... [2018-11-22 22:07:29,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:07:29,558 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:07:29,657 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:07:29,660 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:07:29,675 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:07:29,683 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:07:29,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29 WrapperNode [2018-11-22 22:07:29,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:07:29,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:07:29,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:07:29,684 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:07:29,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29" (1/1) ... [2018-11-22 22:07:29,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29" (1/1) ... [2018-11-22 22:07:29,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:07:29,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:07:29,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:07:29,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:07:29,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29" (1/1) ... [2018-11-22 22:07:29,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29" (1/1) ... [2018-11-22 22:07:29,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29" (1/1) ... [2018-11-22 22:07:29,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29" (1/1) ... [2018-11-22 22:07:29,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29" (1/1) ... [2018-11-22 22:07:29,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29" (1/1) ... [2018-11-22 22:07:29,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29" (1/1) ... [2018-11-22 22:07:29,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:07:29,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:07:29,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:07:29,716 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:07:29,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:07:29,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:07:29,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:07:29,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:07:29,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:07:29,783 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:07:29,783 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:07:29,962 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:07:29,962 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 22:07:29,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:07:29 BoogieIcfgContainer [2018-11-22 22:07:29,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:07:29,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:07:29,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:07:29,965 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:07:29,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:07:29" (1/3) ... [2018-11-22 22:07:29,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505bc045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:07:29, skipping insertion in model container [2018-11-22 22:07:29,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:07:29" (2/3) ... [2018-11-22 22:07:29,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505bc045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:07:29, skipping insertion in model container [2018-11-22 22:07:29,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:07:29" (3/3) ... [2018-11-22 22:07:29,968 INFO L112 eAbstractionObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop_false-no-overflow.c [2018-11-22 22:07:29,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:07:29,987 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2018-11-22 22:07:29,997 INFO L257 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2018-11-22 22:07:30,017 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:07:30,017 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:07:30,017 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:07:30,017 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:07:30,017 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:07:30,018 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:07:30,018 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:07:30,018 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:07:30,018 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:07:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-11-22 22:07:30,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-22 22:07:30,037 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:30,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:30,040 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:30,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:30,043 INFO L82 PathProgramCache]: Analyzing trace with hash 40350774, now seen corresponding path program 1 times [2018-11-22 22:07:30,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:30,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:30,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:30,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:30,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:30,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:07:30,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:07:30,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:07:30,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:07:30,158 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 3 states. [2018-11-22 22:07:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:30,347 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2018-11-22 22:07:30,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:07:30,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-22 22:07:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:30,359 INFO L225 Difference]: With dead ends: 186 [2018-11-22 22:07:30,359 INFO L226 Difference]: Without dead ends: 96 [2018-11-22 22:07:30,362 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 [2018-11-22 22:07:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-22 22:07:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-11-22 22:07:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-22 22:07:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2018-11-22 22:07:30,390 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 8 [2018-11-22 22:07:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:30,390 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2018-11-22 22:07:30,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:07:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2018-11-22 22:07:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-22 22:07:30,390 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:30,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:30,391 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:30,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:30,392 INFO L82 PathProgramCache]: Analyzing trace with hash 40350582, now seen corresponding path program 1 times [2018-11-22 22:07:30,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:30,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:30,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:30,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:30,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:30,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:07:30,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:07:30,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:07:30,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:07:30,410 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 3 states. [2018-11-22 22:07:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:30,538 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-11-22 22:07:30,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:07:30,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-22 22:07:30,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:30,539 INFO L225 Difference]: With dead ends: 117 [2018-11-22 22:07:30,539 INFO L226 Difference]: Without dead ends: 101 [2018-11-22 22:07:30,540 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 [2018-11-22 22:07:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-22 22:07:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-11-22 22:07:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-22 22:07:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-11-22 22:07:30,544 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 8 [2018-11-22 22:07:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:30,544 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-11-22 22:07:30,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:07:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-22 22:07:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-22 22:07:30,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:30,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:30,545 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:30,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1250933629, now seen corresponding path program 1 times [2018-11-22 22:07:30,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:30,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:30,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:30,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:07:30,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:07:30,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:07:30,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:07:30,575 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 3 states. [2018-11-22 22:07:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:30,659 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-22 22:07:30,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:07:30,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-22 22:07:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:30,660 INFO L225 Difference]: With dead ends: 94 [2018-11-22 22:07:30,660 INFO L226 Difference]: Without dead ends: 93 [2018-11-22 22:07:30,661 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 [2018-11-22 22:07:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-22 22:07:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-11-22 22:07:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-22 22:07:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-11-22 22:07:30,665 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 9 [2018-11-22 22:07:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:30,665 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-22 22:07:30,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:07:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-11-22 22:07:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-22 22:07:30,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:30,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:30,666 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:30,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash -506607525, now seen corresponding path program 1 times [2018-11-22 22:07:30,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:30,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:30,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:30,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:07:30,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:07:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:07:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:07:30,699 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 4 states. [2018-11-22 22:07:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:30,808 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-11-22 22:07:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:07:30,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-22 22:07:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:30,809 INFO L225 Difference]: With dead ends: 133 [2018-11-22 22:07:30,809 INFO L226 Difference]: Without dead ends: 126 [2018-11-22 22:07:30,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:07:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-22 22:07:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 100. [2018-11-22 22:07:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-22 22:07:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-11-22 22:07:30,814 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 11 [2018-11-22 22:07:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:30,815 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-11-22 22:07:30,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:07:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-11-22 22:07:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-22 22:07:30,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:30,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:30,816 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:30,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:30,817 INFO L82 PathProgramCache]: Analyzing trace with hash -867423228, now seen corresponding path program 1 times [2018-11-22 22:07:30,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:30,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:30,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:30,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:07:30,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:07:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:07:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:07:30,844 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 4 states. [2018-11-22 22:07:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:30,930 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-11-22 22:07:30,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:07:30,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-22 22:07:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:30,931 INFO L225 Difference]: With dead ends: 109 [2018-11-22 22:07:30,931 INFO L226 Difference]: Without dead ends: 108 [2018-11-22 22:07:30,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:07:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-22 22:07:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2018-11-22 22:07:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-22 22:07:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-11-22 22:07:30,936 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 12 [2018-11-22 22:07:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:30,937 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-11-22 22:07:30,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:07:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-11-22 22:07:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 22:07:30,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:30,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:30,938 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:30,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:30,939 INFO L82 PathProgramCache]: Analyzing trace with hash 170361764, now seen corresponding path program 1 times [2018-11-22 22:07:30,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:30,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:30,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:30,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:30,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:30,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:07:30,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:07:30,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:07:30,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:07:30,963 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 5 states. [2018-11-22 22:07:31,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:31,094 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-11-22 22:07:31,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:07:31,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-22 22:07:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:31,095 INFO L225 Difference]: With dead ends: 154 [2018-11-22 22:07:31,095 INFO L226 Difference]: Without dead ends: 148 [2018-11-22 22:07:31,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:07:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-22 22:07:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 109. [2018-11-22 22:07:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-22 22:07:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-11-22 22:07:31,101 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 14 [2018-11-22 22:07:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:31,101 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-11-22 22:07:31,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:07:31,102 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-11-22 22:07:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-22 22:07:31,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:31,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:31,103 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:31,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:31,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1412911211, now seen corresponding path program 1 times [2018-11-22 22:07:31,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:31,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:31,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:31,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:31,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:31,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:07:31,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:07:31,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:07:31,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:07:31,123 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 5 states. [2018-11-22 22:07:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:31,209 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2018-11-22 22:07:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:07:31,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-22 22:07:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:31,210 INFO L225 Difference]: With dead ends: 118 [2018-11-22 22:07:31,210 INFO L226 Difference]: Without dead ends: 117 [2018-11-22 22:07:31,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:07:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-22 22:07:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2018-11-22 22:07:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-22 22:07:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-11-22 22:07:31,216 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 15 [2018-11-22 22:07:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:31,217 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-11-22 22:07:31,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:07:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-11-22 22:07:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 22:07:31,217 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:31,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:31,218 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:31,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1403957751, now seen corresponding path program 1 times [2018-11-22 22:07:31,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:31,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:31,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:31,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:07:31,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:07:31,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:07:31,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:07:31,250 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 6 states. [2018-11-22 22:07:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:31,404 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2018-11-22 22:07:31,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:07:31,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-22 22:07:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:31,405 INFO L225 Difference]: With dead ends: 172 [2018-11-22 22:07:31,405 INFO L226 Difference]: Without dead ends: 167 [2018-11-22 22:07:31,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:07:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-22 22:07:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 112. [2018-11-22 22:07:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-22 22:07:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-11-22 22:07:31,409 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 17 [2018-11-22 22:07:31,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:31,410 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-11-22 22:07:31,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:07:31,410 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-11-22 22:07:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 22:07:31,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:31,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:31,411 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:31,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:31,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1358476530, now seen corresponding path program 1 times [2018-11-22 22:07:31,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:31,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:31,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:31,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:31,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:31,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:07:31,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:07:31,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:07:31,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:07:31,437 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 6 states. [2018-11-22 22:07:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:31,507 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-11-22 22:07:31,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:07:31,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-22 22:07:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:31,507 INFO L225 Difference]: With dead ends: 121 [2018-11-22 22:07:31,508 INFO L226 Difference]: Without dead ends: 120 [2018-11-22 22:07:31,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:07:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-22 22:07:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2018-11-22 22:07:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-22 22:07:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-11-22 22:07:31,511 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 18 [2018-11-22 22:07:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:31,512 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-11-22 22:07:31,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:07:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-11-22 22:07:31,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 22:07:31,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:31,512 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] [2018-11-22 22:07:31,513 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:31,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:31,513 INFO L82 PathProgramCache]: Analyzing trace with hash -913742894, now seen corresponding path program 1 times [2018-11-22 22:07:31,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:31,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:31,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:31,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:31,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:31,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 22:07:31,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 22:07:31,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:07:31,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:07:31,546 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 7 states. [2018-11-22 22:07:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:31,716 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-22 22:07:31,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:07:31,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-22 22:07:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:31,717 INFO L225 Difference]: With dead ends: 187 [2018-11-22 22:07:31,717 INFO L226 Difference]: Without dead ends: 183 [2018-11-22 22:07:31,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:07:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-22 22:07:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 109. [2018-11-22 22:07:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-22 22:07:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-11-22 22:07:31,721 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 20 [2018-11-22 22:07:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:31,721 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-11-22 22:07:31,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 22:07:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-11-22 22:07:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 22:07:31,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:31,722 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] [2018-11-22 22:07:31,723 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:31,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:31,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1102420647, now seen corresponding path program 1 times [2018-11-22 22:07:31,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:31,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:31,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:31,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:31,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:31,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 22:07:31,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 22:07:31,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:07:31,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:07:31,768 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 7 states. [2018-11-22 22:07:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:31,861 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2018-11-22 22:07:31,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:07:31,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-22 22:07:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:31,862 INFO L225 Difference]: With dead ends: 118 [2018-11-22 22:07:31,863 INFO L226 Difference]: Without dead ends: 117 [2018-11-22 22:07:31,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:07:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-22 22:07:31,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2018-11-22 22:07:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-22 22:07:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-11-22 22:07:31,865 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 21 [2018-11-22 22:07:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:31,865 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-11-22 22:07:31,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 22:07:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-11-22 22:07:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 22:07:31,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:31,866 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] [2018-11-22 22:07:31,867 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:31,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:31,867 INFO L82 PathProgramCache]: Analyzing trace with hash 188269495, now seen corresponding path program 1 times [2018-11-22 22:07:31,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:31,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:31,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:31,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:31,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:31,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 22:07:31,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:07:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:07:31,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:07:31,923 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 8 states. [2018-11-22 22:07:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:32,112 INFO L93 Difference]: Finished difference Result 199 states and 208 transitions. [2018-11-22 22:07:32,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:07:32,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-22 22:07:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:32,114 INFO L225 Difference]: With dead ends: 199 [2018-11-22 22:07:32,114 INFO L226 Difference]: Without dead ends: 196 [2018-11-22 22:07:32,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:07:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-22 22:07:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 100. [2018-11-22 22:07:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-22 22:07:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-11-22 22:07:32,116 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 23 [2018-11-22 22:07:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:32,118 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-11-22 22:07:32,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:07:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-11-22 22:07:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 22:07:32,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:32,119 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] [2018-11-22 22:07:32,119 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:32,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:32,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1401535968, now seen corresponding path program 1 times [2018-11-22 22:07:32,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:32,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:32,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:32,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:32,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:32,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:32,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 22:07:32,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:07:32,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:07:32,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:07:32,156 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 8 states. [2018-11-22 22:07:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:32,241 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-11-22 22:07:32,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:07:32,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-22 22:07:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:32,242 INFO L225 Difference]: With dead ends: 109 [2018-11-22 22:07:32,243 INFO L226 Difference]: Without dead ends: 108 [2018-11-22 22:07:32,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:07:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-22 22:07:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2018-11-22 22:07:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-22 22:07:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-11-22 22:07:32,245 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 24 [2018-11-22 22:07:32,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:32,245 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-11-22 22:07:32,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:07:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-11-22 22:07:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 22:07:32,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:32,246 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, 1] [2018-11-22 22:07:32,247 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:32,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:32,247 INFO L82 PathProgramCache]: Analyzing trace with hash -490646528, now seen corresponding path program 1 times [2018-11-22 22:07:32,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:32,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:32,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:32,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:32,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:32,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:32,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 22:07:32,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 22:07:32,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:07:32,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:07:32,304 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 9 states. [2018-11-22 22:07:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:32,540 INFO L93 Difference]: Finished difference Result 208 states and 217 transitions. [2018-11-22 22:07:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:07:32,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-22 22:07:32,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:32,542 INFO L225 Difference]: With dead ends: 208 [2018-11-22 22:07:32,542 INFO L226 Difference]: Without dead ends: 206 [2018-11-22 22:07:32,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:07:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-22 22:07:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 85. [2018-11-22 22:07:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-22 22:07:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-11-22 22:07:32,544 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 26 [2018-11-22 22:07:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:32,545 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-11-22 22:07:32,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 22:07:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-22 22:07:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 22:07:32,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:32,547 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, 1, 1] [2018-11-22 22:07:32,548 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:32,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:32,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1781070407, now seen corresponding path program 1 times [2018-11-22 22:07:32,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:32,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:32,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:32,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:32,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:32,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 22:07:32,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 22:07:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:07:32,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:07:32,584 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 9 states. [2018-11-22 22:07:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:32,652 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-22 22:07:32,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:07:32,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-22 22:07:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:32,654 INFO L225 Difference]: With dead ends: 94 [2018-11-22 22:07:32,654 INFO L226 Difference]: Without dead ends: 93 [2018-11-22 22:07:32,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:07:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-22 22:07:32,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-11-22 22:07:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-22 22:07:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-11-22 22:07:32,656 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 27 [2018-11-22 22:07:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:32,657 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-22 22:07:32,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 22:07:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-11-22 22:07:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-22 22:07:32,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:32,658 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, 1, 1, 1, 1] [2018-11-22 22:07:32,658 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:32,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:32,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1076876955, now seen corresponding path program 1 times [2018-11-22 22:07:32,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:32,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:32,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:32,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:32,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:32,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:32,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-22 22:07:32,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 22:07:32,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:07:32,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:07:32,701 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 10 states. [2018-11-22 22:07:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:32,964 INFO L93 Difference]: Finished difference Result 214 states and 223 transitions. [2018-11-22 22:07:32,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:07:32,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-22 22:07:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:32,965 INFO L225 Difference]: With dead ends: 214 [2018-11-22 22:07:32,965 INFO L226 Difference]: Without dead ends: 213 [2018-11-22 22:07:32,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:07:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-22 22:07:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 64. [2018-11-22 22:07:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-22 22:07:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-11-22 22:07:32,968 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 29 [2018-11-22 22:07:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:32,968 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-22 22:07:32,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 22:07:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-22 22:07:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 22:07:32,970 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:32,970 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, 1, 1, 1, 1, 1] [2018-11-22 22:07:32,971 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:32,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash -157333810, now seen corresponding path program 1 times [2018-11-22 22:07:32,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:32,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:32,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:33,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:33,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-22 22:07:33,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 22:07:33,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:07:33,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:07:33,027 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 10 states. [2018-11-22 22:07:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:33,109 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-22 22:07:33,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:07:33,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-22 22:07:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:33,109 INFO L225 Difference]: With dead ends: 73 [2018-11-22 22:07:33,110 INFO L226 Difference]: Without dead ends: 72 [2018-11-22 22:07:33,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:07:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-22 22:07:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-11-22 22:07:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-22 22:07:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-11-22 22:07:33,112 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 30 [2018-11-22 22:07:33,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:33,112 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-11-22 22:07:33,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 22:07:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-22 22:07:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-22 22:07:33,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:33,113 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:33,113 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:33,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:33,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2130488114, now seen corresponding path program 1 times [2018-11-22 22:07:33,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:33,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:33,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:33,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:33,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:33,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:33,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-22 22:07:33,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:07:33,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:07:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:07:33,173 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 12 states. [2018-11-22 22:07:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:33,472 INFO L93 Difference]: Finished difference Result 204 states and 221 transitions. [2018-11-22 22:07:33,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-22 22:07:33,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-22 22:07:33,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:33,473 INFO L225 Difference]: With dead ends: 204 [2018-11-22 22:07:33,473 INFO L226 Difference]: Without dead ends: 203 [2018-11-22 22:07:33,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-11-22 22:07:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-22 22:07:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 62. [2018-11-22 22:07:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-22 22:07:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-11-22 22:07:33,482 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 32 [2018-11-22 22:07:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:33,482 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-11-22 22:07:33,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:07:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-22 22:07:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 22:07:33,483 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:33,483 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:33,483 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:33,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:33,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1620621930, now seen corresponding path program 1 times [2018-11-22 22:07:33,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:33,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:33,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:33,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:33,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:07:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:07:33,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:07:33,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-22 22:07:33,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:07:33,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:07:33,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:07:33,578 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 12 states. [2018-11-22 22:07:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:33,814 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2018-11-22 22:07:33,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 22:07:33,815 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-22 22:07:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:33,817 INFO L225 Difference]: With dead ends: 164 [2018-11-22 22:07:33,817 INFO L226 Difference]: Without dead ends: 163 [2018-11-22 22:07:33,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-11-22 22:07:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-22 22:07:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 65. [2018-11-22 22:07:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-22 22:07:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-11-22 22:07:33,823 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 33 [2018-11-22 22:07:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:33,823 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-11-22 22:07:33,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:07:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-22 22:07:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 22:07:33,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:07:33,826 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:07:33,826 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:07:33,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:07:33,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1322054828, now seen corresponding path program 1 times [2018-11-22 22:07:33,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:07:33,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:07:33,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:33,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:07:33,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:07:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:07:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:07:33,857 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #145#return; [?] CALL call #t~ret3 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~y~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~z~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~y~0=(- 2147483640), main_~z~0=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2;~x~0 := -1; VAL [main_~x~0=(- 1), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 1), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 1), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 2), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 2), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 2), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 3), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 3), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 3), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 4), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 4), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 4), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 5), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 5), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 5), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 6), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 6), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 6), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 7), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 7), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 7), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 8), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 8), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 8), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 9), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [main_~x~0=(- 9), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~y~0 + ~x~0 <= 2147483647; VAL [main_~x~0=(- 9), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~y~0 + ~x~0 >= -2147483648); VAL [main_~x~0=(- 9), main_~y~0=(- 2147483640), main_~z~0=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19-L23] assume !(0 != #t~nondet2); [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24-L28] assume !(~x~0 > 0); VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29-L33] assume !(~x~0 > 0); VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34-L38] assume !(~x~0 > 0); VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39-L43] assume !(~x~0 > 0); VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44-L48] assume !(~x~0 > 0); VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49-L53] assume !(~x~0 > 0); VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54-L58] assume !(~x~0 > 0); VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59-L63] assume !(~x~0 > 0); VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19-L23] assume !(0 != #t~nondet2); [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24-L28] assume !(~x~0 > 0); VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29-L33] assume !(~x~0 > 0); VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34-L38] assume !(~x~0 > 0); VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39-L43] assume !(~x~0 > 0); VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44-L48] assume !(~x~0 > 0); VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49-L53] assume !(~x~0 > 0); VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54-L58] assume !(~x~0 > 0); VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59-L63] assume !(~x~0 > 0); VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24] COND FALSE !(~x~0 > 0) VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29] COND FALSE !(~x~0 > 0) VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34] COND FALSE !(~x~0 > 0) VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39] COND FALSE !(~x~0 > 0) VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44] COND FALSE !(~x~0 > 0) VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49] COND FALSE !(~x~0 > 0) VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54] COND FALSE !(~x~0 > 0) VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59] COND FALSE !(~x~0 > 0) VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24] COND FALSE !(~x~0 > 0) VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29] COND FALSE !(~x~0 > 0) VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34] COND FALSE !(~x~0 > 0) VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39] COND FALSE !(~x~0 > 0) VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44] COND FALSE !(~x~0 > 0) VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49] COND FALSE !(~x~0 > 0) VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54] COND FALSE !(~x~0 > 0) VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59] COND FALSE !(~x~0 > 0) VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24] COND FALSE !(~x~0 > 0) VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29] COND FALSE !(~x~0 > 0) VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34] COND FALSE !(~x~0 > 0) VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39] COND FALSE !(~x~0 > 0) VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44] COND FALSE !(~x~0 > 0) VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49] COND FALSE !(~x~0 > 0) VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54] COND FALSE !(~x~0 > 0) VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59] COND FALSE !(~x~0 > 0) VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24] COND FALSE !(~x~0 > 0) VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29] COND FALSE !(~x~0 > 0) VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34] COND FALSE !(~x~0 > 0) VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39] COND FALSE !(~x~0 > 0) VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44] COND FALSE !(~x~0 > 0) VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49] COND FALSE !(~x~0 > 0) VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54] COND FALSE !(~x~0 > 0) VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59] COND FALSE !(~x~0 > 0) VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 VAL [x=-1, y=-2147483640, z=0] [L24] COND FALSE !(x > 0) VAL [x=-1, y=-2147483640, z=0] [L27] EXPR x - 1 [L27] x = x - 1 VAL [x=-2, y=-2147483640, z=0] [L29] COND FALSE !(x > 0) VAL [x=-2, y=-2147483640, z=0] [L32] EXPR x - 1 [L32] x = x - 1 VAL [x=-3, y=-2147483640, z=0] [L34] COND FALSE !(x > 0) VAL [x=-3, y=-2147483640, z=0] [L37] EXPR x - 1 [L37] x = x - 1 VAL [x=-4, y=-2147483640, z=0] [L39] COND FALSE !(x > 0) VAL [x=-4, y=-2147483640, z=0] [L42] EXPR x - 1 [L42] x = x - 1 VAL [x=-5, y=-2147483640, z=0] [L44] COND FALSE !(x > 0) VAL [x=-5, y=-2147483640, z=0] [L47] EXPR x - 1 [L47] x = x - 1 VAL [x=-6, y=-2147483640, z=0] [L49] COND FALSE !(x > 0) VAL [x=-6, y=-2147483640, z=0] [L52] EXPR x - 1 [L52] x = x - 1 VAL [x=-7, y=-2147483640, z=0] [L54] COND FALSE !(x > 0) VAL [x=-7, y=-2147483640, z=0] [L57] EXPR x - 1 [L57] x = x - 1 VAL [x=-8, y=-2147483640, z=0] [L59] COND FALSE !(x > 0) VAL [x=-8, y=-2147483640, z=0] [L62] EXPR x - 1 [L62] x = x - 1 VAL [x=-9, y=-2147483640, z=0] [L64] COND TRUE y<100 && z<100 VAL [x=-9, y=-2147483640, z=0] [L65] y+x VAL [x=-9, y=-2147483640, z=0] ----- [2018-11-22 22:07:33,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:07:33 BoogieIcfgContainer [2018-11-22 22:07:33,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:07:33,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:07:33,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:07:33,901 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:07:33,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:07:29" (3/4) ... [2018-11-22 22:07:33,902 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #145#return; [?] CALL call #t~ret3 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~y~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~z~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~y~0=(- 2147483640), main_~z~0=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2;~x~0 := -1; VAL [main_~x~0=(- 1), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 1), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 1), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 2), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 2), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 2), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 3), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 3), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 3), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 4), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 4), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 4), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 5), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 5), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 5), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 6), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 6), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 6), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 7), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 7), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 7), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 8), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~x~0 > 0); VAL [main_~x~0=(- 8), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 8), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~x~0=(- 9), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [main_~x~0=(- 9), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume ~y~0 + ~x~0 <= 2147483647; VAL [main_~x~0=(- 9), main_~y~0=(- 2147483640), main_~z~0=0] [?] assume !(~y~0 + ~x~0 >= -2147483648); VAL [main_~x~0=(- 9), main_~y~0=(- 2147483640), main_~z~0=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19-L23] assume !(0 != #t~nondet2); [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24-L28] assume !(~x~0 > 0); VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29-L33] assume !(~x~0 > 0); VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34-L38] assume !(~x~0 > 0); VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39-L43] assume !(~x~0 > 0); VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44-L48] assume !(~x~0 > 0); VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49-L53] assume !(~x~0 > 0); VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54-L58] assume !(~x~0 > 0); VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59-L63] assume !(~x~0 > 0); VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19-L23] assume !(0 != #t~nondet2); [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24-L28] assume !(~x~0 > 0); VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29-L33] assume !(~x~0 > 0); VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34-L38] assume !(~x~0 > 0); VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39-L43] assume !(~x~0 > 0); VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44-L48] assume !(~x~0 > 0); VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49-L53] assume !(~x~0 > 0); VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54-L58] assume !(~x~0 > 0); VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59-L63] assume !(~x~0 > 0); VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] assume !!(~y~0 < 100 && ~z~0 < 100); VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24] COND FALSE !(~x~0 > 0) VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29] COND FALSE !(~x~0 > 0) VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34] COND FALSE !(~x~0 > 0) VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39] COND FALSE !(~x~0 > 0) VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44] COND FALSE !(~x~0 > 0) VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49] COND FALSE !(~x~0 > 0) VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54] COND FALSE !(~x~0 > 0) VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59] COND FALSE !(~x~0 > 0) VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24] COND FALSE !(~x~0 > 0) VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29] COND FALSE !(~x~0 > 0) VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34] COND FALSE !(~x~0 > 0) VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39] COND FALSE !(~x~0 > 0) VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44] COND FALSE !(~x~0 > 0) VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49] COND FALSE !(~x~0 > 0) VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54] COND FALSE !(~x~0 > 0) VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59] COND FALSE !(~x~0 > 0) VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24] COND FALSE !(~x~0 > 0) VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29] COND FALSE !(~x~0 > 0) VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34] COND FALSE !(~x~0 > 0) VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39] COND FALSE !(~x~0 > 0) VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44] COND FALSE !(~x~0 > 0) VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49] COND FALSE !(~x~0 > 0) VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54] COND FALSE !(~x~0 > 0) VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59] COND FALSE !(~x~0 > 0) VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~x~0; [L15] havoc ~y~0; [L16] havoc ~z~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~y~0 := #t~nondet0; [L17] havoc #t~nondet0; [L18] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L18] ~z~0 := #t~nondet1; [L18] havoc #t~nondet1; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~y~0=-2147483640, ~z~0=0] [L19] COND FALSE !(0 != #t~nondet2) [L19] havoc #t~nondet2; [L22] ~x~0 := -1; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L24] COND FALSE !(~x~0 > 0) VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-1, ~y~0=-2147483640, ~z~0=0] [L27] assert ~x~0 - 1 >= -2147483648; [L27] ~x~0 := ~x~0 - 1; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L29] COND FALSE !(~x~0 > 0) VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2, ~y~0=-2147483640, ~z~0=0] [L32] assert ~x~0 - 1 >= -2147483648; [L32] ~x~0 := ~x~0 - 1; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L34] COND FALSE !(~x~0 > 0) VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-3, ~y~0=-2147483640, ~z~0=0] [L37] assert ~x~0 - 1 >= -2147483648; [L37] ~x~0 := ~x~0 - 1; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L39] COND FALSE !(~x~0 > 0) VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-4, ~y~0=-2147483640, ~z~0=0] [L42] assert ~x~0 - 1 >= -2147483648; [L42] ~x~0 := ~x~0 - 1; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L44] COND FALSE !(~x~0 > 0) VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-5, ~y~0=-2147483640, ~z~0=0] [L47] assert ~x~0 - 1 >= -2147483648; [L47] ~x~0 := ~x~0 - 1; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L49] COND FALSE !(~x~0 > 0) VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-6, ~y~0=-2147483640, ~z~0=0] [L52] assert ~x~0 - 1 >= -2147483648; [L52] ~x~0 := ~x~0 - 1; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L54] COND FALSE !(~x~0 > 0) VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-7, ~y~0=-2147483640, ~z~0=0] [L57] assert ~x~0 - 1 >= -2147483648; [L57] ~x~0 := ~x~0 - 1; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L59] COND FALSE !(~x~0 > 0) VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-8, ~y~0=-2147483640, ~z~0=0] [L62] assert ~x~0 - 1 >= -2147483648; [L62] ~x~0 := ~x~0 - 1; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L64-L67] COND FALSE !(!(~y~0 < 100 && ~z~0 < 100)) VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 <= 2147483647; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L65] assert ~y~0 + ~x~0 >= -2147483648; VAL [~x~0=-9, ~y~0=-2147483640, ~z~0=0] [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 VAL [x=-1, y=-2147483640, z=0] [L24] COND FALSE !(x > 0) VAL [x=-1, y=-2147483640, z=0] [L27] EXPR x - 1 [L27] x = x - 1 VAL [x=-2, y=-2147483640, z=0] [L29] COND FALSE !(x > 0) VAL [x=-2, y=-2147483640, z=0] [L32] EXPR x - 1 [L32] x = x - 1 VAL [x=-3, y=-2147483640, z=0] [L34] COND FALSE !(x > 0) VAL [x=-3, y=-2147483640, z=0] [L37] EXPR x - 1 [L37] x = x - 1 VAL [x=-4, y=-2147483640, z=0] [L39] COND FALSE !(x > 0) VAL [x=-4, y=-2147483640, z=0] [L42] EXPR x - 1 [L42] x = x - 1 VAL [x=-5, y=-2147483640, z=0] [L44] COND FALSE !(x > 0) VAL [x=-5, y=-2147483640, z=0] [L47] EXPR x - 1 [L47] x = x - 1 VAL [x=-6, y=-2147483640, z=0] [L49] COND FALSE !(x > 0) VAL [x=-6, y=-2147483640, z=0] [L52] EXPR x - 1 [L52] x = x - 1 VAL [x=-7, y=-2147483640, z=0] [L54] COND FALSE !(x > 0) VAL [x=-7, y=-2147483640, z=0] [L57] EXPR x - 1 [L57] x = x - 1 VAL [x=-8, y=-2147483640, z=0] [L59] COND FALSE !(x > 0) VAL [x=-8, y=-2147483640, z=0] [L62] EXPR x - 1 [L62] x = x - 1 VAL [x=-9, y=-2147483640, z=0] [L64] COND TRUE y<100 && z<100 VAL [x=-9, y=-2147483640, z=0] [L65] y+x VAL [x=-9, y=-2147483640, z=0] ----- [2018-11-22 22:07:33,996 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_25f45d9d-6080-4880-a548-637c0002d52e/bin-2019/uautomizer/witness.graphml [2018-11-22 22:07:33,996 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:07:33,997 INFO L168 Benchmark]: Toolchain (without parser) took 4464.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:33,998 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:07:33,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.89 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:33,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.52 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:33,999 INFO L168 Benchmark]: Boogie Preprocessor took 16.10 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:07:33,999 INFO L168 Benchmark]: RCFGBuilder took 246.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:33,999 INFO L168 Benchmark]: TraceAbstraction took 3937.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:34,000 INFO L168 Benchmark]: Witness Printer took 95.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:34,002 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.89 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.52 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.10 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 246.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3937.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Witness Printer took 95.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 65]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 VAL [x=-1, y=-2147483640, z=0] [L24] COND FALSE !(x > 0) VAL [x=-1, y=-2147483640, z=0] [L27] EXPR x - 1 [L27] x = x - 1 VAL [x=-2, y=-2147483640, z=0] [L29] COND FALSE !(x > 0) VAL [x=-2, y=-2147483640, z=0] [L32] EXPR x - 1 [L32] x = x - 1 VAL [x=-3, y=-2147483640, z=0] [L34] COND FALSE !(x > 0) VAL [x=-3, y=-2147483640, z=0] [L37] EXPR x - 1 [L37] x = x - 1 VAL [x=-4, y=-2147483640, z=0] [L39] COND FALSE !(x > 0) VAL [x=-4, y=-2147483640, z=0] [L42] EXPR x - 1 [L42] x = x - 1 VAL [x=-5, y=-2147483640, z=0] [L44] COND FALSE !(x > 0) VAL [x=-5, y=-2147483640, z=0] [L47] EXPR x - 1 [L47] x = x - 1 VAL [x=-6, y=-2147483640, z=0] [L49] COND FALSE !(x > 0) VAL [x=-6, y=-2147483640, z=0] [L52] EXPR x - 1 [L52] x = x - 1 VAL [x=-7, y=-2147483640, z=0] [L54] COND FALSE !(x > 0) VAL [x=-7, y=-2147483640, z=0] [L57] EXPR x - 1 [L57] x = x - 1 VAL [x=-8, y=-2147483640, z=0] [L59] COND FALSE !(x > 0) VAL [x=-8, y=-2147483640, z=0] [L62] EXPR x - 1 [L62] x = x - 1 VAL [x=-9, y=-2147483640, z=0] [L64] COND TRUE y<100 && z<100 VAL [x=-9, y=-2147483640, z=0] [L65] y+x VAL [x=-9, y=-2147483640, z=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 92 locations, 36 error locations. UNSAFE Result, 3.8s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 546 SDtfs, 1877 SDslu, 451 SDs, 0 SdLazy, 5284 SolverSat, 759 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=8, 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.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 896 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 27874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...