./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c27ad91a5bec233234e07a14bfd5505e082df4cd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:25:53,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:25:53,470 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:25:53,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:25:53,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:25:53,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:25:53,485 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:25:53,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:25:53,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:25:53,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:25:53,490 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:25:53,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:25:53,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:25:53,493 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:25:53,494 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:25:53,494 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:25:53,495 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:25:53,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:25:53,499 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:25:53,500 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:25:53,502 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:25:53,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:25:53,505 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:25:53,505 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:25:53,506 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:25:53,507 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:25:53,508 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:25:53,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:25:53,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:25:53,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:25:53,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:25:53,511 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:25:53,511 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:25:53,511 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:25:53,512 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:25:53,513 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:25:53,513 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:25:53,528 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:25:53,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:25:53,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:25:53,529 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:25:53,530 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:25:53,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:25:53,530 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:25:53,530 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:25:53,530 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:25:53,530 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:25:53,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:25:53,531 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:25:53,531 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:25:53,531 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:25:53,531 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:25:53,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:25:53,532 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:25:53,532 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:25:53,532 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:25:53,532 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:25:53,532 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:25:53,533 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:25:53,533 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:25:53,533 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:25:53,533 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:25:53,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:25:53,533 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c27ad91a5bec233234e07a14bfd5505e082df4cd [2019-01-14 21:25:53,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:25:53,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:25:53,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:25:53,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:25:53,595 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:25:53,596 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-14 21:25:53,657 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29e727ade/26f1671d6477407281efe3c9cbb88d2e/FLAGed410b691 [2019-01-14 21:25:54,047 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:25:54,048 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-14 21:25:54,054 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29e727ade/26f1671d6477407281efe3c9cbb88d2e/FLAGed410b691 [2019-01-14 21:25:54,447 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29e727ade/26f1671d6477407281efe3c9cbb88d2e [2019-01-14 21:25:54,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:25:54,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:25:54,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:25:54,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:25:54,463 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:25:54,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:25:54" (1/1) ... [2019-01-14 21:25:54,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3222e414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54, skipping insertion in model container [2019-01-14 21:25:54,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:25:54" (1/1) ... [2019-01-14 21:25:54,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:25:54,502 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:25:54,720 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:25:54,726 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:25:54,751 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:25:54,766 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:25:54,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54 WrapperNode [2019-01-14 21:25:54,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:25:54,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:25:54,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:25:54,768 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:25:54,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54" (1/1) ... [2019-01-14 21:25:54,785 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54" (1/1) ... [2019-01-14 21:25:54,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:25:54,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:25:54,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:25:54,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:25:54,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54" (1/1) ... [2019-01-14 21:25:54,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54" (1/1) ... [2019-01-14 21:25:54,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54" (1/1) ... [2019-01-14 21:25:54,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54" (1/1) ... [2019-01-14 21:25:54,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54" (1/1) ... [2019-01-14 21:25:54,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54" (1/1) ... [2019-01-14 21:25:54,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54" (1/1) ... [2019-01-14 21:25:54,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:25:54,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:25:54,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:25:54,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:25:54,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:25:54,961 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-14 21:25:54,961 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-14 21:25:54,961 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-14 21:25:54,962 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-14 21:25:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:25:54,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:25:55,468 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:25:55,469 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 21:25:55,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:55 BoogieIcfgContainer [2019-01-14 21:25:55,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:25:55,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:25:55,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:25:55,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:25:55,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:25:54" (1/3) ... [2019-01-14 21:25:55,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339692f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:25:55, skipping insertion in model container [2019-01-14 21:25:55,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:54" (2/3) ... [2019-01-14 21:25:55,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339692f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:25:55, skipping insertion in model container [2019-01-14 21:25:55,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:55" (3/3) ... [2019-01-14 21:25:55,484 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-14 21:25:55,494 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:25:55,502 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-14 21:25:55,518 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-14 21:25:55,555 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:25:55,556 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:25:55,556 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:25:55,556 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:25:55,556 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:25:55,556 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:25:55,557 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:25:55,557 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:25:55,557 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:25:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-01-14 21:25:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:25:55,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:55,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:25:55,593 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash 68150020, now seen corresponding path program 1 times [2019-01-14 21:25:55,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:55,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:55,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:55,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:55,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:55,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:55,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:25:55,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:55,986 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-01-14 21:25:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:56,255 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-01-14 21:25:56,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:25:56,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-14 21:25:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:56,269 INFO L225 Difference]: With dead ends: 64 [2019-01-14 21:25:56,269 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 21:25:56,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:25:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 21:25:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-14 21:25:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 21:25:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-01-14 21:25:56,326 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-01-14 21:25:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:56,326 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-01-14 21:25:56,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-01-14 21:25:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 21:25:56,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:56,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 21:25:56,328 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:56,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:56,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2112650676, now seen corresponding path program 1 times [2019-01-14 21:25:56,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:56,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:56,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:56,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:56,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:56,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:56,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:25:56,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:25:56,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:25:56,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:25:56,389 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-01-14 21:25:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:56,417 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-01-14 21:25:56,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:25:56,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-14 21:25:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:56,420 INFO L225 Difference]: With dead ends: 52 [2019-01-14 21:25:56,420 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 21:25:56,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:25:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 21:25:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-14 21:25:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 21:25:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-01-14 21:25:56,431 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2019-01-14 21:25:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:56,431 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-01-14 21:25:56,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:25:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-01-14 21:25:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 21:25:56,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:56,433 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:56,433 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash 803040358, now seen corresponding path program 1 times [2019-01-14 21:25:56,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:56,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:56,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:56,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:56,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:56,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:56,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 21:25:56,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:25:56,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:25:56,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:25:56,678 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 7 states. [2019-01-14 21:25:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:57,035 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-01-14 21:25:57,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:25:57,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-14 21:25:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:57,041 INFO L225 Difference]: With dead ends: 67 [2019-01-14 21:25:57,041 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 21:25:57,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:25:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 21:25:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-01-14 21:25:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 21:25:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-01-14 21:25:57,063 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 13 [2019-01-14 21:25:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:57,064 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-01-14 21:25:57,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:25:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-01-14 21:25:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 21:25:57,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:57,065 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:57,067 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:57,067 INFO L82 PathProgramCache]: Analyzing trace with hash 407065914, now seen corresponding path program 1 times [2019-01-14 21:25:57,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:57,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:57,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:57,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 21:25:57,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:57,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:25:57,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:57,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:57,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:57,158 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 5 states. [2019-01-14 21:25:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:57,293 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2019-01-14 21:25:57,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:25:57,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-14 21:25:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:57,295 INFO L225 Difference]: With dead ends: 77 [2019-01-14 21:25:57,295 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 21:25:57,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:25:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 21:25:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-01-14 21:25:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 21:25:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-01-14 21:25:57,311 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 16 [2019-01-14 21:25:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:57,311 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-01-14 21:25:57,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-01-14 21:25:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 21:25:57,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:57,312 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:57,313 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:57,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash -265858514, now seen corresponding path program 1 times [2019-01-14 21:25:57,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:57,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:57,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 21:25:57,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:57,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:25:57,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:25:57,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:25:57,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:25:57,347 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 3 states. [2019-01-14 21:25:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:57,369 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-01-14 21:25:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:25:57,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 21:25:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:57,371 INFO L225 Difference]: With dead ends: 67 [2019-01-14 21:25:57,372 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 21:25:57,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:25:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 21:25:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-01-14 21:25:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 21:25:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-01-14 21:25:57,383 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 17 [2019-01-14 21:25:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:57,384 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-14 21:25:57,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:25:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-01-14 21:25:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 21:25:57,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:57,385 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:57,386 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:57,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash 182136625, now seen corresponding path program 1 times [2019-01-14 21:25:57,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:57,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:57,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:57,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:57,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 21:25:57,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:57,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 21:25:57,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:57,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:57,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:57,642 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2019-01-14 21:25:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:57,810 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2019-01-14 21:25:57,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:25:57,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 21:25:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:57,813 INFO L225 Difference]: With dead ends: 123 [2019-01-14 21:25:57,813 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 21:25:57,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:25:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 21:25:57,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-01-14 21:25:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 21:25:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-01-14 21:25:57,829 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 21 [2019-01-14 21:25:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:57,829 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-01-14 21:25:57,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-01-14 21:25:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 21:25:57,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:57,831 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:57,833 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:57,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:57,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1650762684, now seen corresponding path program 1 times [2019-01-14 21:25:57,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:57,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:57,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:57,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:57,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 21:25:57,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:57,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:25:57,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:57,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:57,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:57,919 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 5 states. [2019-01-14 21:25:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:57,985 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-01-14 21:25:57,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:25:57,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 21:25:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:57,989 INFO L225 Difference]: With dead ends: 72 [2019-01-14 21:25:57,989 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 21:25:57,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:25:57,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 21:25:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-01-14 21:25:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 21:25:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-01-14 21:25:57,999 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 21 [2019-01-14 21:25:57,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:58,000 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-01-14 21:25:58,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-01-14 21:25:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 21:25:58,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:58,001 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:58,002 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:58,002 INFO L82 PathProgramCache]: Analyzing trace with hash 365964416, now seen corresponding path program 1 times [2019-01-14 21:25:58,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:58,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:58,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:58,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 21:25:58,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:58,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:25:58,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:58,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:58,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:58,083 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 5 states. [2019-01-14 21:25:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:58,236 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-01-14 21:25:58,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:25:58,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-14 21:25:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:58,239 INFO L225 Difference]: With dead ends: 75 [2019-01-14 21:25:58,239 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 21:25:58,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:25:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 21:25:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-01-14 21:25:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 21:25:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2019-01-14 21:25:58,250 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 22 [2019-01-14 21:25:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:58,250 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2019-01-14 21:25:58,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2019-01-14 21:25:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 21:25:58,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:58,252 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:58,253 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:58,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:58,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1716415092, now seen corresponding path program 1 times [2019-01-14 21:25:58,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:58,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:58,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:58,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 21:25:58,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:58,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:25:58,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:58,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-14 21:25:58,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:58,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2019-01-14 21:25:58,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 21:25:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 21:25:58,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:25:58,562 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 10 states. [2019-01-14 21:25:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:59,123 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2019-01-14 21:25:59,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:25:59,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-01-14 21:25:59,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:59,125 INFO L225 Difference]: With dead ends: 84 [2019-01-14 21:25:59,125 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 21:25:59,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-01-14 21:25:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 21:25:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-01-14 21:25:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 21:25:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2019-01-14 21:25:59,137 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 42 [2019-01-14 21:25:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:59,137 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2019-01-14 21:25:59,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 21:25:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2019-01-14 21:25:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-14 21:25:59,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:59,140 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:59,141 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:59,142 INFO L82 PathProgramCache]: Analyzing trace with hash 407346927, now seen corresponding path program 1 times [2019-01-14 21:25:59,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:59,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:59,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:59,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:59,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 21:25:59,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:25:59,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:25:59,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:59,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:25:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 21:25:59,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:25:59,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 21:25:59,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:25:59,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:25:59,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:25:59,479 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 7 states. [2019-01-14 21:25:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:59,690 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2019-01-14 21:25:59,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:25:59,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-01-14 21:25:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:59,693 INFO L225 Difference]: With dead ends: 128 [2019-01-14 21:25:59,693 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:25:59,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:25:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:25:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:25:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:25:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:25:59,699 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2019-01-14 21:25:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:59,699 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:25:59,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:25:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:25:59,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:25:59,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:26:00,029 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-01-14 21:26:00,171 INFO L448 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 21:26:00,171 INFO L448 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 21:26:00,171 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2019-01-14 21:26:00,172 INFO L444 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (and (or (and (<= f_~x 2147483646) (<= |f_#in~x| f_~x) (<= 1 f_~x)) (< 2147483646 |f_#in~x|)) (or (<= f_~x 2147483645) (< 2147483645 |f_#in~x|))) [2019-01-14 21:26:00,172 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-01-14 21:26:00,172 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-14 21:26:00,172 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2019-01-14 21:26:00,172 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-01-14 21:26:00,172 INFO L444 ceAbstractionStarter]: At program point L14-4(line 14) the Hoare annotation is: (and (or (< 2147483646 |f_#in~x|) (and (<= f_~x 2147483646) (<= |f_#in~x| f_~x))) (or (and (<= f_~x 2147483645) (<= 1 f_~x)) (< 2147483645 |f_#in~x|))) [2019-01-14 21:26:00,172 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-01-14 21:26:00,172 INFO L448 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 21:26:00,173 INFO L448 ceAbstractionStarter]: For program point L14-6(line 14) no Hoare annotation was computed. [2019-01-14 21:26:00,173 INFO L448 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 21:26:00,173 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2019-01-14 21:26:00,173 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-01-14 21:26:00,173 INFO L451 ceAbstractionStarter]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2019-01-14 21:26:00,173 INFO L448 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,173 INFO L448 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,173 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2019-01-14 21:26:00,174 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,174 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2019-01-14 21:26:00,174 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,174 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= 1 g_~x) (<= g_~x 2147483647) (<= |g_#in~x| g_~x)) (< 2147483647 |g_#in~x|)) [2019-01-14 21:26:00,174 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,174 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,174 INFO L448 ceAbstractionStarter]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,174 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,174 INFO L444 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (or (and (<= 1 g_~x) (<= 0 (+ |g_#t~ret2| 2147483648)) (<= g_~x 2147483647) (<= |g_#t~ret2| 2147483647) (<= |g_#in~x| 1)) (< 2147483647 |g_#in~x|)) [2019-01-14 21:26:00,175 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,175 INFO L448 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,175 INFO L448 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,175 INFO L448 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,175 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2019-01-14 21:26:00,175 INFO L448 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,175 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2019-01-14 21:26:00,175 INFO L448 ceAbstractionStarter]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:26:00,175 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:26:00,176 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:26:00,176 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:26:00,176 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-14 21:26:00,176 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-14 21:26:00,176 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 27) no Hoare annotation was computed. [2019-01-14 21:26:00,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:26:00 BoogieIcfgContainer [2019-01-14 21:26:00,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:26:00,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:26:00,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:26:00,181 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:26:00,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:55" (3/4) ... [2019-01-14 21:26:00,185 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:26:00,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-01-14 21:26:00,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-01-14 21:26:00,198 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 21:26:00,198 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 21:26:00,252 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:26:00,253 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:26:00,254 INFO L168 Benchmark]: Toolchain (without parser) took 5799.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 952.7 MB in the beginning and 805.3 MB in the end (delta: 147.4 MB). Peak memory consumption was 220.8 MB. Max. memory is 11.5 GB. [2019-01-14 21:26:00,255 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:26:00,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.41 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:26:00,256 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.50 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:26:00,256 INFO L168 Benchmark]: Boogie Preprocessor took 24.25 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:26:00,257 INFO L168 Benchmark]: RCFGBuilder took 636.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 941.9 MB in the beginning and 1.0 GB in the end (delta: -107.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 21:26:00,257 INFO L168 Benchmark]: TraceAbstraction took 4709.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 805.3 MB in the end (delta: 243.7 MB). Peak memory consumption was 243.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:26:00,258 INFO L168 Benchmark]: Witness Printer took 72.56 ms. Allocated memory is still 1.1 GB. Free memory is still 805.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:26:00,261 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.41 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 40.50 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.25 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 636.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 941.9 MB in the beginning and 1.0 GB in the end (delta: -107.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4709.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 805.3 MB in the end (delta: 243.7 MB). Peak memory consumption was 243.7 MB. Max. memory is 11.5 GB. * Witness Printer took 72.56 ms. Allocated memory is still 1.1 GB. Free memory is still 805.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 10 error locations. SAFE Result, 4.6s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 307 SDtfs, 258 SDslu, 727 SDs, 0 SdLazy, 459 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 37 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 82 PreInvPairs, 93 NumberOfFragments, 92 HoareAnnotationTreeSize, 82 FomulaSimplifications, 66 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 129 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 21012 SizeOfPredicates, 5 NumberOfNonLiveVariables, 208 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 159/188 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...