./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 01:16:53,541 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:16:53,543 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:16:53,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:16:53,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:16:53,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:16:53,558 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:16:53,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:16:53,569 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:16:53,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:16:53,575 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:16:53,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:16:53,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:16:53,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:16:53,581 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:16:53,582 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:16:53,583 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:16:53,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:16:53,595 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:16:53,597 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:16:53,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:16:53,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:16:53,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:16:53,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:16:53,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:16:53,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:16:53,614 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:16:53,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:16:53,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:16:53,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:16:53,621 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:16:53,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:16:53,624 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:16:53,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:16:53,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:16:53,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:16:53,629 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:16:53,656 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:16:53,657 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:16:53,658 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:16:53,658 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:16:53,658 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:16:53,659 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:16:53,659 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:16:53,659 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:16:53,659 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:16:53,659 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:16:53,659 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:16:53,661 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:16:53,661 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:16:53,661 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:16:53,661 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:16:53,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:16:53,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:16:53,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:16:53,662 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:16:53,662 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:16:53,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:16:53,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:16:53,665 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:16:53,665 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:16:53,665 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:16:53,666 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:16:53,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:16:53,666 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 01:16:53,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:16:53,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:16:53,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:16:53,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:16:53,756 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:16:53,756 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 01:16:53,810 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885c38d42/73d1f1de7835437a8dff1cae61e93649/FLAGfbcd0c7dc [2019-01-14 01:16:54,229 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:16:54,230 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-14 01:16:54,237 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885c38d42/73d1f1de7835437a8dff1cae61e93649/FLAGfbcd0c7dc [2019-01-14 01:16:54,587 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885c38d42/73d1f1de7835437a8dff1cae61e93649 [2019-01-14 01:16:54,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:16:54,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:16:54,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:16:54,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:16:54,596 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:16:54,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:16:54" (1/1) ... [2019-01-14 01:16:54,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf550ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54, skipping insertion in model container [2019-01-14 01:16:54,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:16:54" (1/1) ... [2019-01-14 01:16:54,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:16:54,631 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:16:54,783 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:16:54,787 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:16:54,800 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:16:54,811 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:16:54,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54 WrapperNode [2019-01-14 01:16:54,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:16:54,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:16:54,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:16:54,813 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:16:54,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54" (1/1) ... [2019-01-14 01:16:54,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54" (1/1) ... [2019-01-14 01:16:54,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:16:54,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:16:54,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:16:54,841 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:16:54,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54" (1/1) ... [2019-01-14 01:16:54,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54" (1/1) ... [2019-01-14 01:16:54,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54" (1/1) ... [2019-01-14 01:16:54,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54" (1/1) ... [2019-01-14 01:16:54,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54" (1/1) ... [2019-01-14 01:16:54,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54" (1/1) ... [2019-01-14 01:16:54,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54" (1/1) ... [2019-01-14 01:16:54,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:16:54,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:16:54,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:16:54,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:16:54,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16: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 01:16:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-14 01:16:54,966 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-14 01:16:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-14 01:16:54,966 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-14 01:16:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:16:54,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:16:55,345 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:16:55,346 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 01:16:55,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:16:55 BoogieIcfgContainer [2019-01-14 01:16:55,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:16:55,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:16:55,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:16:55,351 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:16:55,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:16:54" (1/3) ... [2019-01-14 01:16:55,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2756fd23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:16:55, skipping insertion in model container [2019-01-14 01:16:55,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:16:54" (2/3) ... [2019-01-14 01:16:55,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2756fd23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:16:55, skipping insertion in model container [2019-01-14 01:16:55,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:16:55" (3/3) ... [2019-01-14 01:16:55,354 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-14 01:16:55,365 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:16:55,373 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-14 01:16:55,391 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-14 01:16:55,421 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:16:55,422 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:16:55,422 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:16:55,422 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:16:55,422 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:16:55,422 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:16:55,422 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:16:55,423 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:16:55,423 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:16:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-01-14 01:16:55,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 01:16:55,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:55,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 01:16:55,449 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:55,455 INFO L82 PathProgramCache]: Analyzing trace with hash 68150020, now seen corresponding path program 1 times [2019-01-14 01:16:55,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:55,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:55,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:55,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:55,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:55,645 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 01:16:55,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:16:55,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:16:55,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:16:55,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:16:55,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:16:55,670 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-01-14 01:16:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:56,108 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-01-14 01:16:56,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:16:56,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-14 01:16:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:56,121 INFO L225 Difference]: With dead ends: 64 [2019-01-14 01:16:56,121 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 01:16:56,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:16:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 01:16:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-14 01:16:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 01:16:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-01-14 01:16:56,167 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-01-14 01:16:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:56,168 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-01-14 01:16:56,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:16:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-01-14 01:16:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 01:16:56,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:56,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 01:16:56,169 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:56,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:56,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2112650676, now seen corresponding path program 1 times [2019-01-14 01:16:56,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:56,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:56,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:56,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:56,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:56,231 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 01:16:56,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:16:56,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:16:56,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:16:56,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:16:56,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:16:56,240 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-01-14 01:16:56,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:56,306 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-01-14 01:16:56,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:16:56,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-14 01:16:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:56,309 INFO L225 Difference]: With dead ends: 52 [2019-01-14 01:16:56,309 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 01:16:56,310 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 01:16:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 01:16:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-14 01:16:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 01:16:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-01-14 01:16:56,321 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2019-01-14 01:16:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:56,322 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-01-14 01:16:56,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:16:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-01-14 01:16:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 01:16:56,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:56,324 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:56,324 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash 803040358, now seen corresponding path program 1 times [2019-01-14 01:16:56,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:56,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:56,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:56,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:56,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:56,490 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 01:16:56,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:16:56,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 01:16:56,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:16:56,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:16:56,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:16:56,492 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 7 states. [2019-01-14 01:16:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:57,003 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-01-14 01:16:57,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:16:57,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-14 01:16:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:57,006 INFO L225 Difference]: With dead ends: 67 [2019-01-14 01:16:57,006 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 01:16:57,008 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 01:16:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 01:16:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-01-14 01:16:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 01:16:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-01-14 01:16:57,022 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 13 [2019-01-14 01:16:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:57,023 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-01-14 01:16:57,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:16:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-01-14 01:16:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 01:16:57,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:57,024 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:57,025 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:57,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:57,025 INFO L82 PathProgramCache]: Analyzing trace with hash 407065914, now seen corresponding path program 1 times [2019-01-14 01:16:57,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:57,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:57,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:57,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:57,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:57,088 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 01:16:57,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:16:57,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:16:57,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:16:57,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:16:57,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:16:57,090 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 5 states. [2019-01-14 01:16:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:57,225 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2019-01-14 01:16:57,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:16:57,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-14 01:16:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:57,228 INFO L225 Difference]: With dead ends: 77 [2019-01-14 01:16:57,228 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 01:16:57,229 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 01:16:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 01:16:57,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-01-14 01:16:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 01:16:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-01-14 01:16:57,250 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 16 [2019-01-14 01:16:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:57,250 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-01-14 01:16:57,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:16:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-01-14 01:16:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 01:16:57,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:57,253 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:57,253 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:57,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash -265858514, now seen corresponding path program 1 times [2019-01-14 01:16:57,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:57,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:57,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:57,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:57,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:57,310 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 01:16:57,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:16:57,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:16:57,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:16:57,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:16:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:16:57,312 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 3 states. [2019-01-14 01:16:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:57,370 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-01-14 01:16:57,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:16:57,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 01:16:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:57,372 INFO L225 Difference]: With dead ends: 67 [2019-01-14 01:16:57,373 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 01:16:57,373 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 01:16:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 01:16:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-01-14 01:16:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 01:16:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-01-14 01:16:57,383 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 17 [2019-01-14 01:16:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:57,383 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-14 01:16:57,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:16:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-01-14 01:16:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 01:16:57,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16: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 01:16:57,386 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:57,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash 182136625, now seen corresponding path program 1 times [2019-01-14 01:16:57,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:57,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:57,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:57,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:57,461 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 01:16:57,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:16:57,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:16:57,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:16:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:16:57,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:16:57,463 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2019-01-14 01:16:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:57,621 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2019-01-14 01:16:57,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:16:57,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 01:16:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:57,623 INFO L225 Difference]: With dead ends: 123 [2019-01-14 01:16:57,624 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 01:16:57,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:16:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 01:16:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-01-14 01:16:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 01:16:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-01-14 01:16:57,636 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 21 [2019-01-14 01:16:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:57,636 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-01-14 01:16:57,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:16:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-01-14 01:16:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 01:16:57,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:57,638 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 01:16:57,639 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:57,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:57,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1650762684, now seen corresponding path program 1 times [2019-01-14 01:16:57,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:57,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:57,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:57,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:57,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:57,895 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 01:16:57,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:16:57,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:16:57,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:16:57,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:16:57,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:16:57,897 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 5 states. [2019-01-14 01:16:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:57,972 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-01-14 01:16:57,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:16:57,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 01:16:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:57,977 INFO L225 Difference]: With dead ends: 72 [2019-01-14 01:16:57,977 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 01:16:57,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 01:16:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 01:16:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-01-14 01:16:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 01:16:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-01-14 01:16:57,992 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 21 [2019-01-14 01:16:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:57,993 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-01-14 01:16:57,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:16:57,993 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-01-14 01:16:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 01:16:57,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:57,995 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 01:16:57,996 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:57,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash 365964416, now seen corresponding path program 1 times [2019-01-14 01:16:57,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:57,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:58,058 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 01:16:58,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:16:58,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:16:58,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:16:58,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:16:58,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:16:58,061 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 5 states. [2019-01-14 01:16:58,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:58,157 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-01-14 01:16:58,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:16:58,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-14 01:16:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:58,159 INFO L225 Difference]: With dead ends: 75 [2019-01-14 01:16:58,159 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 01:16:58,160 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 01:16:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 01:16:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-01-14 01:16:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 01:16:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2019-01-14 01:16:58,168 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 22 [2019-01-14 01:16:58,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:58,169 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2019-01-14 01:16:58,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:16:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2019-01-14 01:16:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 01:16:58,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:58,171 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:58,171 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash 829792618, now seen corresponding path program 1 times [2019-01-14 01:16:58,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:58,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:58,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 01:16:58,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:58,290 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 01:16:58,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:58,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 01:16:58,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:58,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 01:16:58,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:16:58,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:16:58,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:16:58,407 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 5 states. [2019-01-14 01:16:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:58,546 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-01-14 01:16:58,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:16:58,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-01-14 01:16:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:58,550 INFO L225 Difference]: With dead ends: 85 [2019-01-14 01:16:58,550 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 01:16:58,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 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 01:16:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 01:16:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-01-14 01:16:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 01:16:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2019-01-14 01:16:58,561 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 50 [2019-01-14 01:16:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:58,562 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2019-01-14 01:16:58,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:16:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2019-01-14 01:16:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 01:16:58,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:58,564 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:16:58,564 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:58,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1466563401, now seen corresponding path program 2 times [2019-01-14 01:16:58,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:58,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:58,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 01:16:58,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:58,716 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 01:16:58,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:16:58,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:16:58,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:16:58,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 01:16:58,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:58,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:16:58,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:16:58,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:16:58,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:16:58,803 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand 7 states. [2019-01-14 01:16:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:59,227 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2019-01-14 01:16:59,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:16:59,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-01-14 01:16:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:59,229 INFO L225 Difference]: With dead ends: 80 [2019-01-14 01:16:59,229 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 01:16:59,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:16:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 01:16:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-14 01:16:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 01:16:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2019-01-14 01:16:59,244 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 34 [2019-01-14 01:16:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:59,245 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2019-01-14 01:16:59,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:16:59,245 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2019-01-14 01:16:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-14 01:16:59,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:59,250 INFO L402 BasicCegarLoop]: trace histogram [10, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 01:16:59,251 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:59,251 INFO L82 PathProgramCache]: Analyzing trace with hash 875153490, now seen corresponding path program 1 times [2019-01-14 01:16:59,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:59,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:59,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:59,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:16:59,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 31 proven. 61 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-01-14 01:16:59,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:59,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:59,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:59,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:16:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-01-14 01:16:59,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:16:59,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:16:59,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:16:59,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:16:59,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:16:59,587 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 7 states. [2019-01-14 01:16:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:16:59,729 INFO L93 Difference]: Finished difference Result 177 states and 223 transitions. [2019-01-14 01:16:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:16:59,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2019-01-14 01:16:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:16:59,732 INFO L225 Difference]: With dead ends: 177 [2019-01-14 01:16:59,732 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 01:16:59,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:16:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 01:16:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2019-01-14 01:16:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 01:16:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2019-01-14 01:16:59,744 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 110 [2019-01-14 01:16:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:16:59,745 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2019-01-14 01:16:59,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:16:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2019-01-14 01:16:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-14 01:16:59,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:16:59,747 INFO L402 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 01:16:59,747 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:16:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:16:59,748 INFO L82 PathProgramCache]: Analyzing trace with hash 564914831, now seen corresponding path program 2 times [2019-01-14 01:16:59,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:16:59,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:16:59,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:59,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:16:59,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:16:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:16:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 59 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-14 01:16:59,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:16:59,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:16:59,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:17:00,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:17:00,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:00,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 35 proven. 13 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-01-14 01:17:00,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:00,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2019-01-14 01:17:00,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 01:17:00,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 01:17:00,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-01-14 01:17:00,320 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand 16 states. [2019-01-14 01:17:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:00,662 INFO L93 Difference]: Finished difference Result 133 states and 156 transitions. [2019-01-14 01:17:00,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:17:00,664 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2019-01-14 01:17:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:00,665 INFO L225 Difference]: With dead ends: 133 [2019-01-14 01:17:00,665 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:17:00,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-01-14 01:17:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:17:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:17:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:17:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:17:00,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2019-01-14 01:17:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:00,668 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:17:00,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 01:17:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:17:00,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:17:00,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:17:00,973 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2019-01-14 01:17:00,973 INFO L448 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:17:00,974 INFO L448 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:17:00,974 INFO L444 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (and (< 0 (+ |f_#in~x| 1)) (or (and (<= f_~x 2147483646) (<= |f_#in~x| f_~x) (<= 1 f_~x)) (< 2147483646 |f_#in~x|))) [2019-01-14 01:17:00,974 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-01-14 01:17:00,974 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-14 01:17:00,974 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2019-01-14 01:17:00,975 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-01-14 01:17:00,975 INFO L444 ceAbstractionStarter]: At program point L14-4(line 14) the Hoare annotation is: (and (or (and (<= f_~x 2147483646) (<= |f_#in~x| f_~x) (<= |f_#t~ret0| 0) (<= 1 f_~x)) (< 2147483646 |f_#in~x|)) (< 0 (+ |f_#in~x| 1))) [2019-01-14 01:17:00,975 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-01-14 01:17:00,975 INFO L448 ceAbstractionStarter]: For program point L14-6(line 14) no Hoare annotation was computed. [2019-01-14 01:17:00,975 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2019-01-14 01:17:00,975 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-01-14 01:17:00,975 INFO L448 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:17:00,975 INFO L448 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:17:00,975 INFO L451 ceAbstractionStarter]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2019-01-14 01:17:00,976 INFO L448 ceAbstractionStarter]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,976 INFO L448 ceAbstractionStarter]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,976 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2019-01-14 01:17:00,976 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,976 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2019-01-14 01:17:00,976 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,976 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 01:17:00,976 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,977 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,977 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,977 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 1) (<= |g_#t~ret2| 0) (<= |g_#in~x| 1)) (< 2147483647 |g_#in~x|)) [2019-01-14 01:17:00,977 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,977 INFO L448 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,977 INFO L448 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,977 INFO L448 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,977 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2019-01-14 01:17:00,977 INFO L448 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,978 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2019-01-14 01:17:00,978 INFO L448 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,978 INFO L448 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:17:00,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:17:00,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:17:00,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:17:00,978 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-14 01:17:00,978 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-14 01:17:00,978 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 27) no Hoare annotation was computed. [2019-01-14 01:17:00,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:17:00 BoogieIcfgContainer [2019-01-14 01:17:00,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:17:00,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:17:00,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:17:00,983 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:17:00,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:16:55" (3/4) ... [2019-01-14 01:17:00,987 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:17:00,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-01-14 01:17:00,994 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-01-14 01:17:01,000 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 01:17:01,000 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:17:01,058 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:17:01,058 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:17:01,059 INFO L168 Benchmark]: Toolchain (without parser) took 6468.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -159.8 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:01,061 INFO L168 Benchmark]: CDTParser took 0.15 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 01:17:01,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.91 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.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 01:17:01,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.11 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:01,063 INFO L168 Benchmark]: Boogie Preprocessor took 16.81 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:01,063 INFO L168 Benchmark]: RCFGBuilder took 488.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:01,064 INFO L168 Benchmark]: TraceAbstraction took 5634.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 66.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:01,065 INFO L168 Benchmark]: Witness Printer took 75.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:01,068 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.15 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 219.91 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.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 28.11 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.81 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 488.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5634.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 66.7 MB. Max. memory is 11.5 GB. * Witness Printer took 75.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. 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, 5.5s OverallTime, 12 OverallIterations, 10 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 364 SDtfs, 288 SDslu, 889 SDs, 0 SdLazy, 632 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=11, 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, 12 MinimizatonAttempts, 47 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 109 PreInvPairs, 115 NumberOfFragments, 90 HoareAnnotationTreeSize, 109 FomulaSimplifications, 33 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 98 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 697 ConstructedInterpolants, 0 QuantifiedInterpolants, 76480 SizeOfPredicates, 6 NumberOfNonLiveVariables, 596 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 952/1068 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...