./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-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 9072a9376e1e28de1ef4dc11b7134f6f175023b7 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:34:16,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:34:16,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:34:16,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:34:16,629 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:34:16,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:34:16,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:34:16,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:34:16,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:34:16,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:34:16,638 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:34:16,639 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:34:16,640 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:34:16,641 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:34:16,642 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:34:16,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:34:16,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:34:16,647 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:34:16,649 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:34:16,651 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:34:16,652 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:34:16,654 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:34:16,657 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:34:16,657 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:34:16,657 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:34:16,658 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:34:16,660 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:34:16,661 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:34:16,662 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:34:16,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:34:16,664 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:34:16,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:34:16,665 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:34:16,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:34:16,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:34:16,667 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:34:16,668 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:34:16,685 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:34:16,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:34:16,687 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:34:16,688 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:34:16,688 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:34:16,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:34:16,688 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:34:16,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:34:16,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:34:16,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:34:16,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:34:16,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:34:16,690 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:34:16,690 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:34:16,690 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:34:16,691 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:34:16,691 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:34:16,691 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:34:16,691 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:34:16,691 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:34:16,693 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:34:16,693 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:34:16,693 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:34:16,693 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:34:16,693 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:34:16,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:34:16,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:34:16,694 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 -> 9072a9376e1e28de1ef4dc11b7134f6f175023b7 [2019-01-01 20:34:16,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:34:16,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:34:16,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:34:16,764 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:34:16,765 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:34:16,765 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:16,833 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1444659f0/dccbe0ae75504fc7819130f39789d688/FLAG0614a83d6 [2019-01-01 20:34:17,315 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:34:17,316 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:17,323 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1444659f0/dccbe0ae75504fc7819130f39789d688/FLAG0614a83d6 [2019-01-01 20:34:17,660 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1444659f0/dccbe0ae75504fc7819130f39789d688 [2019-01-01 20:34:17,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:34:17,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:34:17,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:17,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:34:17,676 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:34:17,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7079eec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17, skipping insertion in model container [2019-01-01 20:34:17,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:34:17,707 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:34:17,936 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:17,942 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:34:17,972 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:17,990 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:34:17,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17 WrapperNode [2019-01-01 20:34:17,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:17,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:17,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:34:17,992 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:34:18,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:18,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:18,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:18,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:34:18,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:34:18,037 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:34:18,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:18,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:18,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:18,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:18,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:18,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:18,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:18,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:34:18,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:34:18,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:34:18,071 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:34:18,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:34:18,210 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-01 20:34:18,210 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-01 20:34:18,211 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 20:34:18,211 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 20:34:18,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:34:18,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:34:18,622 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:34:18,623 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 20:34:18,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:18 BoogieIcfgContainer [2019-01-01 20:34:18,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:34:18,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:34:18,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:34:18,628 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:34:18,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:34:17" (1/3) ... [2019-01-01 20:34:18,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9a282d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:18, skipping insertion in model container [2019-01-01 20:34:18,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (2/3) ... [2019-01-01 20:34:18,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9a282d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:18, skipping insertion in model container [2019-01-01 20:34:18,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:18" (3/3) ... [2019-01-01 20:34:18,632 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:18,643 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:34:18,651 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-01 20:34:18,670 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-01 20:34:18,706 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:34:18,707 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:34:18,707 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:34:18,707 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:34:18,708 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:34:18,708 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:34:18,708 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:34:18,708 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:34:18,709 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:34:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-01-01 20:34:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:34:18,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:18,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:34:18,741 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash 68150020, now seen corresponding path program 1 times [2019-01-01 20:34:18,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:18,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:18,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:18,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:18,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:18,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:18,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:18,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:18,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:18,997 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-01-01 20:34:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:19,214 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-01-01 20:34:19,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:19,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-01 20:34:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:19,229 INFO L225 Difference]: With dead ends: 64 [2019-01-01 20:34:19,230 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 20:34:19,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-01 20:34:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 20:34:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-01 20:34:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 20:34:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-01-01 20:34:19,288 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-01-01 20:34:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:19,289 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-01-01 20:34:19,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-01-01 20:34:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:34:19,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:19,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:34:19,290 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:19,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:19,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2112650676, now seen corresponding path program 1 times [2019-01-01 20:34:19,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:19,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:19,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:19,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:19,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:19,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:19,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:19,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:19,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:19,359 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-01-01 20:34:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:19,430 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-01-01 20:34:19,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:19,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:34:19,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:19,433 INFO L225 Difference]: With dead ends: 52 [2019-01-01 20:34:19,433 INFO L226 Difference]: Without dead ends: 50 [2019-01-01 20:34:19,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-01 20:34:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-01 20:34:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 20:34:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-01-01 20:34:19,446 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2019-01-01 20:34:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:19,446 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-01-01 20:34:19,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-01-01 20:34:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 20:34:19,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:19,448 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:19,449 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:19,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:19,450 INFO L82 PathProgramCache]: Analyzing trace with hash 803040358, now seen corresponding path program 1 times [2019-01-01 20:34:19,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:19,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:19,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:19,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:19,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 20:34:19,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:34:19,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:34:19,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:19,705 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 7 states. [2019-01-01 20:34:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:20,123 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-01-01 20:34:20,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:34:20,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-01 20:34:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:20,127 INFO L225 Difference]: With dead ends: 67 [2019-01-01 20:34:20,128 INFO L226 Difference]: Without dead ends: 65 [2019-01-01 20:34:20,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:34:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-01 20:34:20,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-01-01 20:34:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-01 20:34:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-01-01 20:34:20,141 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 13 [2019-01-01 20:34:20,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:20,142 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-01-01 20:34:20,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:34:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-01-01 20:34:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 20:34:20,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:20,143 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:20,144 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:20,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:20,144 INFO L82 PathProgramCache]: Analyzing trace with hash 407065914, now seen corresponding path program 1 times [2019-01-01 20:34:20,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:20,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:20,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:20,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:20,215 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-01 20:34:20,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:20,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:20,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:20,217 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 5 states. [2019-01-01 20:34:20,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:20,355 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2019-01-01 20:34:20,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:20,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-01 20:34:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:20,359 INFO L225 Difference]: With dead ends: 77 [2019-01-01 20:34:20,360 INFO L226 Difference]: Without dead ends: 76 [2019-01-01 20:34:20,360 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-01 20:34:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-01 20:34:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-01-01 20:34:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 20:34:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-01-01 20:34:20,376 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 16 [2019-01-01 20:34:20,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:20,376 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-01-01 20:34:20,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-01-01 20:34:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 20:34:20,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:20,377 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:20,378 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:20,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:20,379 INFO L82 PathProgramCache]: Analyzing trace with hash -265858514, now seen corresponding path program 1 times [2019-01-01 20:34:20,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:20,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:20,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:20,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:20,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:20,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:20,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:20,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:20,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:20,416 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 3 states. [2019-01-01 20:34:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:20,441 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-01-01 20:34:20,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:20,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-01 20:34:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:20,443 INFO L225 Difference]: With dead ends: 67 [2019-01-01 20:34:20,443 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 20:34:20,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:20,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 20:34:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-01-01 20:34:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 20:34:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-01-01 20:34:20,456 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 17 [2019-01-01 20:34:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:20,456 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-01 20:34:20,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-01-01 20:34:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 20:34:20,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:20,458 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-01 20:34:20,459 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:20,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:20,459 INFO L82 PathProgramCache]: Analyzing trace with hash 182136625, now seen corresponding path program 1 times [2019-01-01 20:34:20,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:20,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:20,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:20,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:20,561 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-01 20:34:20,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:20,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:34:20,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:20,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:20,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:20,564 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2019-01-01 20:34:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:20,745 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2019-01-01 20:34:20,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:20,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 20:34:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:20,747 INFO L225 Difference]: With dead ends: 123 [2019-01-01 20:34:20,747 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 20:34:20,749 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-01 20:34:20,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 20:34:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-01-01 20:34:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 20:34:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-01-01 20:34:20,766 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 21 [2019-01-01 20:34:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:20,767 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-01-01 20:34:20,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-01-01 20:34:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 20:34:20,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:20,769 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-01 20:34:20,771 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:20,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1650762684, now seen corresponding path program 1 times [2019-01-01 20:34:20,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:20,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:20,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,033 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-01 20:34:21,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:21,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:21,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:21,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:21,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:21,036 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 5 states. [2019-01-01 20:34:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:21,108 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-01-01 20:34:21,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:21,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 20:34:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:21,111 INFO L225 Difference]: With dead ends: 72 [2019-01-01 20:34:21,112 INFO L226 Difference]: Without dead ends: 71 [2019-01-01 20:34:21,112 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-01 20:34:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-01 20:34:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-01-01 20:34:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 20:34:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-01-01 20:34:21,129 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 21 [2019-01-01 20:34:21,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:21,132 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-01-01 20:34:21,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-01-01 20:34:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 20:34:21,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:21,133 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-01 20:34:21,135 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:21,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:21,135 INFO L82 PathProgramCache]: Analyzing trace with hash 365964416, now seen corresponding path program 1 times [2019-01-01 20:34:21,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:21,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:21,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,229 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-01 20:34:21,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:21,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:21,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:21,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:21,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:21,231 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 5 states. [2019-01-01 20:34:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:21,335 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-01-01 20:34:21,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:21,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-01 20:34:21,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:21,338 INFO L225 Difference]: With dead ends: 75 [2019-01-01 20:34:21,338 INFO L226 Difference]: Without dead ends: 71 [2019-01-01 20:34:21,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-01 20:34:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-01 20:34:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-01-01 20:34:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 20:34:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2019-01-01 20:34:21,352 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 22 [2019-01-01 20:34:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:21,352 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2019-01-01 20:34:21,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2019-01-01 20:34:21,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 20:34:21,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:21,355 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-01 20:34:21,355 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:21,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:21,355 INFO L82 PathProgramCache]: Analyzing trace with hash 829792618, now seen corresponding path program 1 times [2019-01-01 20:34:21,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:21,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:21,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,466 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-01 20:34:21,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:21,467 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-01 20:34:21,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:21,574 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-01 20:34:21,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:21,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 20:34:21,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:21,598 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 5 states. [2019-01-01 20:34:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:21,735 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-01-01 20:34:21,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:21,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-01-01 20:34:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:21,739 INFO L225 Difference]: With dead ends: 85 [2019-01-01 20:34:21,739 INFO L226 Difference]: Without dead ends: 84 [2019-01-01 20:34:21,740 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-01 20:34:21,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-01 20:34:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-01-01 20:34:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-01 20:34:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2019-01-01 20:34:21,750 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 50 [2019-01-01 20:34:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:21,752 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2019-01-01 20:34:21,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2019-01-01 20:34:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 20:34:21,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:21,753 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-01 20:34:21,755 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1466563401, now seen corresponding path program 2 times [2019-01-01 20:34:21,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:21,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,893 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-01 20:34:21,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:21,893 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-01 20:34:21,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:21,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:21,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:21,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:21,957 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-01 20:34:21,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:21,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:34:21,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:34:21,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:34:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:21,994 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand 7 states. [2019-01-01 20:34:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:22,461 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2019-01-01 20:34:22,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:22,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-01-01 20:34:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:22,463 INFO L225 Difference]: With dead ends: 80 [2019-01-01 20:34:22,463 INFO L226 Difference]: Without dead ends: 78 [2019-01-01 20:34:22,464 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-01 20:34:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-01 20:34:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-01 20:34:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-01 20:34:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2019-01-01 20:34:22,474 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 34 [2019-01-01 20:34:22,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:22,474 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2019-01-01 20:34:22,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:34:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2019-01-01 20:34:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-01 20:34:22,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:22,478 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:22,480 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:22,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1929359181, now seen corresponding path program 1 times [2019-01-01 20:34:22,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:22,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:22,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:22,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-01 20:34:22,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:22,725 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-01 20:34:22,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:22,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-01 20:34:22,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:22,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-01 20:34:22,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:34:22,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:34:22,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:22,897 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 10 states. [2019-01-01 20:34:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:23,079 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2019-01-01 20:34:23,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:34:23,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-01-01 20:34:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:23,082 INFO L225 Difference]: With dead ends: 131 [2019-01-01 20:34:23,082 INFO L226 Difference]: Without dead ends: 130 [2019-01-01 20:34:23,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-01 20:34:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2019-01-01 20:34:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 20:34:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2019-01-01 20:34:23,098 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 68 [2019-01-01 20:34:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:23,098 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2019-01-01 20:34:23,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:34:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2019-01-01 20:34:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-01 20:34:23,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:23,103 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:23,103 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:23,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:23,105 INFO L82 PathProgramCache]: Analyzing trace with hash -257147105, now seen corresponding path program 1 times [2019-01-01 20:34:23,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:23,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:23,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-01 20:34:23,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:23,249 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-01 20:34:23,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-01 20:34:23,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:23,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-01 20:34:23,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:34:23,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:34:23,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:23,463 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand 10 states. [2019-01-01 20:34:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:23,634 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2019-01-01 20:34:23,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:34:23,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-01-01 20:34:23,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:23,637 INFO L225 Difference]: With dead ends: 130 [2019-01-01 20:34:23,638 INFO L226 Difference]: Without dead ends: 129 [2019-01-01 20:34:23,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-01 20:34:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2019-01-01 20:34:23,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 20:34:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2019-01-01 20:34:23,651 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 61 [2019-01-01 20:34:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:23,651 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2019-01-01 20:34:23,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:34:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2019-01-01 20:34:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-01 20:34:23,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:23,655 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:23,656 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:23,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:23,656 INFO L82 PathProgramCache]: Analyzing trace with hash 338040259, now seen corresponding path program 1 times [2019-01-01 20:34:23,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:23,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:23,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-01-01 20:34:23,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:23,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:23,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:23,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-01 20:34:24,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:24,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 10 [2019-01-01 20:34:24,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:34:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:34:24,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:24,003 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 10 states. [2019-01-01 20:34:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:24,555 INFO L93 Difference]: Finished difference Result 214 states and 273 transitions. [2019-01-01 20:34:24,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:34:24,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-01-01 20:34:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:24,558 INFO L225 Difference]: With dead ends: 214 [2019-01-01 20:34:24,558 INFO L226 Difference]: Without dead ends: 114 [2019-01-01 20:34:24,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:34:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-01 20:34:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2019-01-01 20:34:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 20:34:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2019-01-01 20:34:24,573 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 73 [2019-01-01 20:34:24,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:24,573 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2019-01-01 20:34:24,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:34:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2019-01-01 20:34:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-01 20:34:24,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:24,580 INFO L402 BasicCegarLoop]: trace histogram [13, 10, 9, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:34:24,580 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash 977262768, now seen corresponding path program 1 times [2019-01-01 20:34:24,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:24,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:24,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 148 proven. 41 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-01-01 20:34:24,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:24,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:24,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:24,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 228 proven. 112 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-01-01 20:34:25,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:25,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 16 [2019-01-01 20:34:25,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:34:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:34:25,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:34:25,337 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand 16 states. [2019-01-01 20:34:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:26,512 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2019-01-01 20:34:26,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 20:34:26,513 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 154 [2019-01-01 20:34:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:26,516 INFO L225 Difference]: With dead ends: 274 [2019-01-01 20:34:26,517 INFO L226 Difference]: Without dead ends: 168 [2019-01-01 20:34:26,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-01-01 20:34:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-01 20:34:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2019-01-01 20:34:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-01 20:34:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2019-01-01 20:34:26,535 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 154 [2019-01-01 20:34:26,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:26,536 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2019-01-01 20:34:26,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:34:26,536 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2019-01-01 20:34:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-01-01 20:34:26,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:26,542 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1] [2019-01-01 20:34:26,543 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:26,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:26,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1765762818, now seen corresponding path program 2 times [2019-01-01 20:34:26,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:26,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:26,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:26,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:26,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 411 proven. 4 refuted. 0 times theorem prover too weak. 1567 trivial. 0 not checked. [2019-01-01 20:34:26,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:26,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:26,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:26,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:26,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:26,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 826 proven. 276 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-01-01 20:34:27,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:27,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 22 [2019-01-01 20:34:27,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 20:34:27,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 20:34:27,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-01-01 20:34:27,707 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand 22 states. [2019-01-01 20:34:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:29,275 INFO L93 Difference]: Finished difference Result 385 states and 483 transitions. [2019-01-01 20:34:29,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-01 20:34:29,278 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 297 [2019-01-01 20:34:29,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:29,282 INFO L225 Difference]: With dead ends: 385 [2019-01-01 20:34:29,283 INFO L226 Difference]: Without dead ends: 237 [2019-01-01 20:34:29,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=374, Invalid=2382, Unknown=0, NotChecked=0, Total=2756 [2019-01-01 20:34:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-01-01 20:34:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 207. [2019-01-01 20:34:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-01 20:34:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 246 transitions. [2019-01-01 20:34:29,305 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 246 transitions. Word has length 297 [2019-01-01 20:34:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:29,306 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 246 transitions. [2019-01-01 20:34:29,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 20:34:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2019-01-01 20:34:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-01 20:34:29,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:29,310 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 11, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2019-01-01 20:34:29,311 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:29,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:29,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1865597505, now seen corresponding path program 1 times [2019-01-01 20:34:29,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:29,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:29,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:29,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:29,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 208 proven. 6 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2019-01-01 20:34:29,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:29,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:30,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:30,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 6 proven. 196 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-01-01 20:34:30,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:30,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-01-01 20:34:30,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:34:30,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:34:30,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:34:30,484 INFO L87 Difference]: Start difference. First operand 207 states and 246 transitions. Second operand 13 states. [2019-01-01 20:34:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:30,661 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2019-01-01 20:34:30,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:34:30,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-01-01 20:34:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:30,663 INFO L225 Difference]: With dead ends: 207 [2019-01-01 20:34:30,663 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:34:30,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:34:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:34:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:34:30,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:34:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:34:30,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2019-01-01 20:34:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:30,665 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:34:30,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:34:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:34:30,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:34:30,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:34:30,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:30,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:30,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:31,140 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 13 [2019-01-01 20:34:31,422 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 16 [2019-01-01 20:34:31,908 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 20 [2019-01-01 20:34:31,911 INFO L448 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,911 INFO L448 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,911 INFO L448 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,912 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2019-01-01 20:34:31,912 INFO L448 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,912 INFO L444 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (and (or (and (<= f_~x |f_#in~x|) (<= |f_#in~x| f_~x)) (< 2147483645 |f_#in~x|)) (< 0 |f_#in~x|)) [2019-01-01 20:34:31,912 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-01-01 20:34:31,912 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,912 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,912 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,912 INFO L444 ceAbstractionStarter]: At program point L14-4(line 14) the Hoare annotation is: (and (or (and (<= f_~x |f_#in~x|) (<= 0 |f_#t~ret0|) (<= |f_#in~x| f_~x) (<= |f_#t~ret0| 0)) (< 2147483645 |f_#in~x|)) (< 0 |f_#in~x|)) [2019-01-01 20:34:31,913 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,913 INFO L448 ceAbstractionStarter]: For program point L14-6(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,913 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2019-01-01 20:34:31,913 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-01-01 20:34:31,913 INFO L451 ceAbstractionStarter]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2019-01-01 20:34:31,913 INFO L448 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,913 INFO L448 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,913 INFO L448 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,914 INFO L448 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,914 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2019-01-01 20:34:31,914 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,914 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2019-01-01 20:34:31,914 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,914 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (< 2147483647 |g_#in~x|))) (and (or (<= 1 g_~x) .cse0) (or (and (<= g_~x |g_#in~x|) (<= |g_#in~x| g_~x)) .cse0))) [2019-01-01 20:34:31,914 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,914 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,914 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,915 INFO L444 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (and (or (< 2 |g_#in~x|) (<= 1 g_~x)) (or (and (<= g_~x |g_#in~x|) (<= 0 |g_#t~ret2|) (<= |g_#in~x| g_~x) (<= |g_#t~ret2| 0)) (< 2147483647 |g_#in~x|))) [2019-01-01 20:34:31,915 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,915 INFO L448 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,915 INFO L448 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,915 INFO L448 ceAbstractionStarter]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,915 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2019-01-01 20:34:31,915 INFO L448 ceAbstractionStarter]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:31,915 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2019-01-01 20:34:31,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:34:31,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:34:31,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:34:31,916 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-01 20:34:31,916 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-01 20:34:31,916 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 27) no Hoare annotation was computed. [2019-01-01 20:34:31,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:34:31 BoogieIcfgContainer [2019-01-01 20:34:31,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:34:31,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:34:31,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:34:31,920 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:34:31,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:18" (3/4) ... [2019-01-01 20:34:31,924 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:34:31,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-01-01 20:34:31,931 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-01-01 20:34:31,937 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 20:34:31,937 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:34:31,996 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:34:32,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:34:32,001 INFO L168 Benchmark]: Toolchain (without parser) took 14336.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -216.9 MB). Peak memory consumption was 93.0 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:32,003 INFO L168 Benchmark]: CDTParser took 1.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:32,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:32,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:32,004 INFO L168 Benchmark]: Boogie Preprocessor took 33.51 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:32,004 INFO L168 Benchmark]: RCFGBuilder took 553.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:32,010 INFO L168 Benchmark]: TraceAbstraction took 13294.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -54.2 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:32,013 INFO L168 Benchmark]: Witness Printer took 80.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:32,019 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17 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 322.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.51 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 553.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13294.87 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -54.2 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. * Witness Printer took 80.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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, 13.2s OverallTime, 16 OverallIterations, 24 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 484 SDtfs, 622 SDslu, 1897 SDs, 0 SdLazy, 2160 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1091 GetRequests, 931 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=15, 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.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 140 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 256 PreInvPairs, 302 NumberOfFragments, 93 HoareAnnotationTreeSize, 256 FomulaSimplifications, 2297 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1647 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1967 NumberOfCodeBlocks, 1967 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1943 ConstructedInterpolants, 0 QuantifiedInterpolants, 502515 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1823 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 6250/7036 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...