./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2c_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 14df269faa4a77275028af94d8141ab36c184cf5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 01:17:03,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:17:03,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:17:03,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:17:03,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:17:03,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:17:03,910 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:17:03,913 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:17:03,915 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:17:03,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:17:03,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:17:03,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:17:03,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:17:03,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:17:03,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:17:03,923 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:17:03,925 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:17:03,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:17:03,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:17:03,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:17:03,932 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:17:03,933 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:17:03,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:17:03,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:17:03,937 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:17:03,938 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:17:03,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:17:03,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:17:03,941 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:17:03,943 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:17:03,943 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:17:03,944 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:17:03,944 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:17:03,944 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:17:03,946 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:17:03,947 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:17:03,947 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:17:03,962 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:17:03,963 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:17:03,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:17:03,964 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:17:03,964 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:17:03,964 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:17:03,965 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:17:03,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:17:03,966 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:17:03,966 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:17:03,966 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:17:03,966 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:17:03,966 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:17:03,967 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:17:03,967 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:17:03,967 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:17:03,968 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:17:03,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:17:03,969 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:17:03,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:17:03,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:17:03,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:17:03,969 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:17:03,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:17:03,971 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:17:03,971 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:17:03,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:17:03,971 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 -> 14df269faa4a77275028af94d8141ab36c184cf5 [2019-01-14 01:17:04,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:17:04,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:17:04,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:17:04,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:17:04,039 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:17:04,039 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 01:17:04,105 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70144a4c9/f1f3363432f04d56921b1c0ce112717b/FLAG2a678aed7 [2019-01-14 01:17:04,499 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:17:04,499 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 01:17:04,505 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70144a4c9/f1f3363432f04d56921b1c0ce112717b/FLAG2a678aed7 [2019-01-14 01:17:04,934 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70144a4c9/f1f3363432f04d56921b1c0ce112717b [2019-01-14 01:17:04,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:17:04,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:17:04,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:17:04,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:17:04,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:17:04,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32feeeb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:04, skipping insertion in model container [2019-01-14 01:17:04,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:17:04" (1/1) ... [2019-01-14 01:17:04,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:17:04,973 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:17:05,169 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:17:05,173 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:17:05,189 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:17:05,204 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:17:05,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05 WrapperNode [2019-01-14 01:17:05,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:17:05,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:17:05,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:17:05,207 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:17:05,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05" (1/1) ... [2019-01-14 01:17:05,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05" (1/1) ... [2019-01-14 01:17:05,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:17:05,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:17:05,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:17:05,245 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:17:05,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05" (1/1) ... [2019-01-14 01:17:05,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05" (1/1) ... [2019-01-14 01:17:05,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05" (1/1) ... [2019-01-14 01:17:05,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05" (1/1) ... [2019-01-14 01:17:05,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05" (1/1) ... [2019-01-14 01:17:05,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05" (1/1) ... [2019-01-14 01:17:05,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05" (1/1) ... [2019-01-14 01:17:05,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:17:05,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:17:05,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:17:05,264 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:17:05,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:17:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-14 01:17:05,426 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-14 01:17:05,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:17:05,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:17:05,704 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:17:05,705 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 01:17:05,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:17:05 BoogieIcfgContainer [2019-01-14 01:17:05,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:17:05,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:17:05,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:17:05,711 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:17:05,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:17:04" (1/3) ... [2019-01-14 01:17:05,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a27382e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:17:05, skipping insertion in model container [2019-01-14 01:17:05,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:17:05" (2/3) ... [2019-01-14 01:17:05,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a27382e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:17:05, skipping insertion in model container [2019-01-14 01:17:05,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:17:05" (3/3) ... [2019-01-14 01:17:05,715 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 01:17:05,726 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:17:05,735 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 01:17:05,752 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 01:17:05,784 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:17:05,784 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:17:05,785 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:17:05,785 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:17:05,785 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:17:05,785 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:17:05,785 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:17:05,785 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:17:05,785 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:17:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-01-14 01:17:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 01:17:05,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:05,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 01:17:05,817 INFO L423 AbstractCegarLoop]: === Iteration 1 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:05,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1454635077, now seen corresponding path program 1 times [2019-01-14 01:17:05,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:05,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:05,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:05,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:05,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:06,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:06,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:17:06,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:17:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:17:06,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:06,048 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-01-14 01:17:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:06,242 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-01-14 01:17:06,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:17:06,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-14 01:17:06,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:06,253 INFO L225 Difference]: With dead ends: 41 [2019-01-14 01:17:06,254 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 01:17:06,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:17:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 01:17:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-01-14 01:17:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 01:17:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-01-14 01:17:06,300 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 6 [2019-01-14 01:17:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:06,300 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-14 01:17:06,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:17:06,301 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-01-14 01:17:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:17:06,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:06,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:06,302 INFO L423 AbstractCegarLoop]: === Iteration 2 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:06,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:06,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2144014465, now seen corresponding path program 1 times [2019-01-14 01:17:06,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:06,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:06,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:06,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:06,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:06,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:17:06,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:17:06,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:17:06,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:06,425 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2019-01-14 01:17:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:06,761 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-01-14 01:17:06,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:17:06,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 01:17:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:06,767 INFO L225 Difference]: With dead ends: 50 [2019-01-14 01:17:06,768 INFO L226 Difference]: Without dead ends: 46 [2019-01-14 01:17:06,769 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-14 01:17:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-14 01:17:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2019-01-14 01:17:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 01:17:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-01-14 01:17:06,790 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 7 [2019-01-14 01:17:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:06,791 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-14 01:17:06,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:17:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-01-14 01:17:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:17:06,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:06,793 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:06,794 INFO L423 AbstractCegarLoop]: === Iteration 3 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash -736378463, now seen corresponding path program 1 times [2019-01-14 01:17:06,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:06,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:06,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:06,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:06,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:06,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:17:06,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:06,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:07,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:07,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:17:07,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:17:07,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:17:07,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:17:07,021 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 7 states. [2019-01-14 01:17:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:07,332 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2019-01-14 01:17:07,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:17:07,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-14 01:17:07,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:07,337 INFO L225 Difference]: With dead ends: 63 [2019-01-14 01:17:07,337 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 01:17:07,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:17:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 01:17:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-01-14 01:17:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 01:17:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2019-01-14 01:17:07,353 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 12 [2019-01-14 01:17:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:07,353 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2019-01-14 01:17:07,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:17:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2019-01-14 01:17:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 01:17:07,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:07,354 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:07,355 INFO L423 AbstractCegarLoop]: === Iteration 4 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1009328462, now seen corresponding path program 1 times [2019-01-14 01:17:07,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:07,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:07,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:07,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:17:07,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:17:07,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:17:07,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:17:07,400 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 3 states. [2019-01-14 01:17:07,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:07,416 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2019-01-14 01:17:07,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:17:07,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-14 01:17:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:07,418 INFO L225 Difference]: With dead ends: 52 [2019-01-14 01:17:07,418 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 01:17:07,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:17:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 01:17:07,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-14 01:17:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 01:17:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-01-14 01:17:07,431 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 14 [2019-01-14 01:17:07,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:07,431 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-01-14 01:17:07,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:17:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2019-01-14 01:17:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 01:17:07,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:07,433 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:07,433 INFO L423 AbstractCegarLoop]: === Iteration 5 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:07,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:07,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1224411294, now seen corresponding path program 1 times [2019-01-14 01:17:07,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:07,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:07,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:07,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:07,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:07,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:17:07,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:17:07,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:17:07,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:07,486 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 4 states. [2019-01-14 01:17:07,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:07,579 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2019-01-14 01:17:07,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:17:07,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-14 01:17:07,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:07,584 INFO L225 Difference]: With dead ends: 77 [2019-01-14 01:17:07,584 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 01:17:07,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:17:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 01:17:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-01-14 01:17:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 01:17:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-01-14 01:17:07,599 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 15 [2019-01-14 01:17:07,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:07,603 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-01-14 01:17:07,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:17:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-01-14 01:17:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 01:17:07,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:07,605 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-14 01:17:07,605 INFO L423 AbstractCegarLoop]: === Iteration 6 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:07,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash -231947135, now seen corresponding path program 2 times [2019-01-14 01:17:07,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:07,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:07,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:07,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:17:07,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:17:07,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:17:07,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:07,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:07,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:07,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:17:07,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:17:07,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:17:07,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:17:07,815 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 9 states. [2019-01-14 01:17:08,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:08,303 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2019-01-14 01:17:08,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:17:08,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-14 01:17:08,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:08,305 INFO L225 Difference]: With dead ends: 90 [2019-01-14 01:17:08,306 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 01:17:08,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:17:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 01:17:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-01-14 01:17:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-14 01:17:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-01-14 01:17:08,329 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 17 [2019-01-14 01:17:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:08,330 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-01-14 01:17:08,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:17:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-01-14 01:17:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 01:17:08,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:08,331 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:08,331 INFO L423 AbstractCegarLoop]: === Iteration 7 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:08,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash -855233152, now seen corresponding path program 1 times [2019-01-14 01:17:08,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:08,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:08,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:08,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:08,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:08,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:17:08,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:17:08,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:17:08,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:17:08,483 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 6 states. [2019-01-14 01:17:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:08,926 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2019-01-14 01:17:08,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:17:08,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 01:17:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:08,931 INFO L225 Difference]: With dead ends: 117 [2019-01-14 01:17:08,931 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 01:17:08,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:17:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 01:17:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-01-14 01:17:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 01:17:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-01-14 01:17:08,957 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 19 [2019-01-14 01:17:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:08,958 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-01-14 01:17:08,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:17:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2019-01-14 01:17:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 01:17:08,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:08,960 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:08,960 INFO L423 AbstractCegarLoop]: === Iteration 8 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:08,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:08,961 INFO L82 PathProgramCache]: Analyzing trace with hash -742423898, now seen corresponding path program 1 times [2019-01-14 01:17:08,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:08,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:08,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:08,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:08,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:09,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:09,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:17:09,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:17:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:17:09,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:17:09,041 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 6 states. [2019-01-14 01:17:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:09,286 INFO L93 Difference]: Finished difference Result 135 states and 174 transitions. [2019-01-14 01:17:09,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:17:09,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-14 01:17:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:09,289 INFO L225 Difference]: With dead ends: 135 [2019-01-14 01:17:09,289 INFO L226 Difference]: Without dead ends: 134 [2019-01-14 01:17:09,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:17:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-14 01:17:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2019-01-14 01:17:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-14 01:17:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2019-01-14 01:17:09,322 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 20 [2019-01-14 01:17:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:09,322 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2019-01-14 01:17:09,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:17:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2019-01-14 01:17:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 01:17:09,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:09,325 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-01-14 01:17:09,325 INFO L423 AbstractCegarLoop]: === Iteration 9 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:09,326 INFO L82 PathProgramCache]: Analyzing trace with hash -559247967, now seen corresponding path program 3 times [2019-01-14 01:17:09,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:09,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:09,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:09,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:09,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:09,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:09,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:17:09,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:17:09,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 01:17:09,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:09,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:09,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:09,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:17:09,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:17:09,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:17:09,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:17:09,563 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand 11 states. [2019-01-14 01:17:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:09,901 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2019-01-14 01:17:09,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 01:17:09,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-14 01:17:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:09,904 INFO L225 Difference]: With dead ends: 150 [2019-01-14 01:17:09,904 INFO L226 Difference]: Without dead ends: 149 [2019-01-14 01:17:09,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:17:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-14 01:17:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2019-01-14 01:17:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-14 01:17:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2019-01-14 01:17:09,924 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 22 [2019-01-14 01:17:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:09,924 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2019-01-14 01:17:09,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:17:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2019-01-14 01:17:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 01:17:09,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:09,926 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:09,926 INFO L423 AbstractCegarLoop]: === Iteration 10 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:09,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:09,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1606295908, now seen corresponding path program 2 times [2019-01-14 01:17:09,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:09,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:09,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:09,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:09,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:10,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:10,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:17:10,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:17:10,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:17:10,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:10,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:10,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:10,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:17:10,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:17:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:17:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:17:10,084 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand 8 states. [2019-01-14 01:17:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:10,456 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2019-01-14 01:17:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 01:17:10,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-01-14 01:17:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:10,460 INFO L225 Difference]: With dead ends: 174 [2019-01-14 01:17:10,460 INFO L226 Difference]: Without dead ends: 173 [2019-01-14 01:17:10,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-01-14 01:17:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-14 01:17:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2019-01-14 01:17:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-14 01:17:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 206 transitions. [2019-01-14 01:17:10,478 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 206 transitions. Word has length 25 [2019-01-14 01:17:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:10,479 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 206 transitions. [2019-01-14 01:17:10,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:17:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 206 transitions. [2019-01-14 01:17:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 01:17:10,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:10,480 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-14 01:17:10,481 INFO L423 AbstractCegarLoop]: === Iteration 11 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:10,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:10,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1828550785, now seen corresponding path program 4 times [2019-01-14 01:17:10,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:10,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:10,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:10,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:17:10,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:10,647 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-14 01:17:10,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:17:10,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:17:10,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:10,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-14 01:17:10,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:10,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-01-14 01:17:10,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 01:17:10,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 01:17:10,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:17:10,769 INFO L87 Difference]: Start difference. First operand 161 states and 206 transitions. Second operand 14 states. [2019-01-14 01:17:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:10,966 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. [2019-01-14 01:17:10,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:17:10,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-14 01:17:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:10,976 INFO L225 Difference]: With dead ends: 165 [2019-01-14 01:17:10,976 INFO L226 Difference]: Without dead ends: 164 [2019-01-14 01:17:10,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-14 01:17:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-14 01:17:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-01-14 01:17:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-14 01:17:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 205 transitions. [2019-01-14 01:17:11,005 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 205 transitions. Word has length 27 [2019-01-14 01:17:11,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:11,005 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 205 transitions. [2019-01-14 01:17:11,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 01:17:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 205 transitions. [2019-01-14 01:17:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 01:17:11,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:11,010 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:11,010 INFO L423 AbstractCegarLoop]: === Iteration 12 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:11,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1103662182, now seen corresponding path program 3 times [2019-01-14 01:17:11,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:11,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:11,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:11,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:11,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:11,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:11,546 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-14 01:17:11,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:17:11,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 01:17:11,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:11,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:11,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:11,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:17:11,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:17:11,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:17:11,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:17:11,631 INFO L87 Difference]: Start difference. First operand 161 states and 205 transitions. Second operand 10 states. [2019-01-14 01:17:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:12,207 INFO L93 Difference]: Finished difference Result 194 states and 248 transitions. [2019-01-14 01:17:12,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 01:17:12,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-01-14 01:17:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:12,210 INFO L225 Difference]: With dead ends: 194 [2019-01-14 01:17:12,210 INFO L226 Difference]: Without dead ends: 193 [2019-01-14 01:17:12,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:17:12,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-14 01:17:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-01-14 01:17:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-14 01:17:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 228 transitions. [2019-01-14 01:17:12,226 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 228 transitions. Word has length 30 [2019-01-14 01:17:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:12,226 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 228 transitions. [2019-01-14 01:17:12,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:17:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 228 transitions. [2019-01-14 01:17:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 01:17:12,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:12,228 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:12,229 INFO L423 AbstractCegarLoop]: === Iteration 13 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:12,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1629013057, now seen corresponding path program 1 times [2019-01-14 01:17:12,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:12,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:12,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:12,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:12,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 01:17:12,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:12,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:17:12,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:17:12,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:17:12,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:12,363 INFO L87 Difference]: Start difference. First operand 179 states and 228 transitions. Second operand 5 states. [2019-01-14 01:17:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:12,425 INFO L93 Difference]: Finished difference Result 179 states and 228 transitions. [2019-01-14 01:17:12,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:17:12,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-14 01:17:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:12,433 INFO L225 Difference]: With dead ends: 179 [2019-01-14 01:17:12,433 INFO L226 Difference]: Without dead ends: 178 [2019-01-14 01:17:12,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:17:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-14 01:17:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-01-14 01:17:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-14 01:17:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 218 transitions. [2019-01-14 01:17:12,451 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 218 transitions. Word has length 31 [2019-01-14 01:17:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:12,452 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 218 transitions. [2019-01-14 01:17:12,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:17:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 218 transitions. [2019-01-14 01:17:12,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 01:17:12,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:12,455 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:12,455 INFO L423 AbstractCegarLoop]: === Iteration 14 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash 857271516, now seen corresponding path program 4 times [2019-01-14 01:17:12,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:12,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:12,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:12,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:12,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:17:12,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:12,669 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-14 01:17:12,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:17:12,691 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:17:12,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:12,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 01:17:12,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:17:12,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2019-01-14 01:17:12,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 01:17:12,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 01:17:12,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-01-14 01:17:12,779 INFO L87 Difference]: Start difference. First operand 178 states and 218 transitions. Second operand 16 states. [2019-01-14 01:17:13,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:13,278 INFO L93 Difference]: Finished difference Result 239 states and 303 transitions. [2019-01-14 01:17:13,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:17:13,280 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2019-01-14 01:17:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:13,281 INFO L225 Difference]: With dead ends: 239 [2019-01-14 01:17:13,281 INFO L226 Difference]: Without dead ends: 111 [2019-01-14 01:17:13,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-01-14 01:17:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-14 01:17:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2019-01-14 01:17:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 01:17:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2019-01-14 01:17:13,298 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 35 [2019-01-14 01:17:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:13,299 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2019-01-14 01:17:13,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 01:17:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2019-01-14 01:17:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 01:17:13,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:13,302 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:13,302 INFO L423 AbstractCegarLoop]: === Iteration 15 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:13,303 INFO L82 PathProgramCache]: Analyzing trace with hash -490250333, now seen corresponding path program 1 times [2019-01-14 01:17:13,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:13,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:13,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 01:17:13,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:13,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:17:13,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:17:13,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:17:13,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:17:13,553 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand 5 states. [2019-01-14 01:17:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:14,187 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2019-01-14 01:17:14,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:17:14,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-14 01:17:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:14,193 INFO L225 Difference]: With dead ends: 106 [2019-01-14 01:17:14,193 INFO L226 Difference]: Without dead ends: 105 [2019-01-14 01:17:14,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:17:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-14 01:17:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-14 01:17:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 01:17:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2019-01-14 01:17:14,206 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 35 [2019-01-14 01:17:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:14,207 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2019-01-14 01:17:14,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:17:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2019-01-14 01:17:14,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 01:17:14,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:14,208 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:14,211 INFO L423 AbstractCegarLoop]: === Iteration 16 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:14,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:14,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1982108899, now seen corresponding path program 1 times [2019-01-14 01:17:14,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:14,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:14,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:14,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:14,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 01:17:14,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:17:14,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 01:17:14,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:17:14,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:17:14,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:17:14,363 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand 7 states. [2019-01-14 01:17:14,636 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 01:17:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:14,815 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2019-01-14 01:17:14,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:17:14,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-14 01:17:14,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:14,819 INFO L225 Difference]: With dead ends: 124 [2019-01-14 01:17:14,819 INFO L226 Difference]: Without dead ends: 123 [2019-01-14 01:17:14,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:17:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-14 01:17:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-01-14 01:17:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 01:17:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-01-14 01:17:14,828 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 36 [2019-01-14 01:17:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:14,828 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-01-14 01:17:14,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:17:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-01-14 01:17:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 01:17:14,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:14,829 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:14,830 INFO L423 AbstractCegarLoop]: === Iteration 17 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:14,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash -732976513, now seen corresponding path program 2 times [2019-01-14 01:17:14,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:14,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:14,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:14,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:17:14,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 01:17:15,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:15,034 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-14 01:17:15,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:17:15,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:17:15,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:15,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 01:17:15,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:15,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:17:15,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:17:15,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:17:15,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:17:15,120 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 9 states. [2019-01-14 01:17:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:15,479 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2019-01-14 01:17:15,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 01:17:15,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-01-14 01:17:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:15,480 INFO L225 Difference]: With dead ends: 140 [2019-01-14 01:17:15,480 INFO L226 Difference]: Without dead ends: 139 [2019-01-14 01:17:15,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:17:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-14 01:17:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-14 01:17:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-14 01:17:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2019-01-14 01:17:15,490 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 41 [2019-01-14 01:17:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:15,490 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2019-01-14 01:17:15,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:17:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2019-01-14 01:17:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 01:17:15,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:15,492 INFO L402 BasicCegarLoop]: trace histogram [7, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:15,493 INFO L423 AbstractCegarLoop]: === Iteration 18 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2029893219, now seen corresponding path program 3 times [2019-01-14 01:17:15,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:15,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:15,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 01:17:15,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:15,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:17:15,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:17:15,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-14 01:17:15,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:15,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 01:17:15,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:15,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:17:15,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:17:15,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:17:15,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:17:15,675 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand 11 states. [2019-01-14 01:17:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:16,108 INFO L93 Difference]: Finished difference Result 158 states and 183 transitions. [2019-01-14 01:17:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 01:17:16,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-01-14 01:17:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:16,110 INFO L225 Difference]: With dead ends: 158 [2019-01-14 01:17:16,110 INFO L226 Difference]: Without dead ends: 157 [2019-01-14 01:17:16,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2019-01-14 01:17:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-14 01:17:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-01-14 01:17:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-14 01:17:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-01-14 01:17:16,121 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 46 [2019-01-14 01:17:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:16,122 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-01-14 01:17:16,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:17:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-01-14 01:17:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 01:17:16,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:16,124 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:16,125 INFO L423 AbstractCegarLoop]: === Iteration 19 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash -613451521, now seen corresponding path program 4 times [2019-01-14 01:17:16,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:16,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:16,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 01:17:16,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:16,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:17:16,304 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:17:16,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:17:16,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:16,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 01:17:16,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:17:16,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 01:17:16,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 01:17:16,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 01:17:16,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:17:16,353 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 13 states. [2019-01-14 01:17:16,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:16,919 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2019-01-14 01:17:16,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 01:17:16,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-01-14 01:17:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:16,931 INFO L225 Difference]: With dead ends: 176 [2019-01-14 01:17:16,931 INFO L226 Difference]: Without dead ends: 175 [2019-01-14 01:17:16,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 01:17:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-14 01:17:16,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-14 01:17:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-14 01:17:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2019-01-14 01:17:16,945 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 51 [2019-01-14 01:17:16,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:16,945 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2019-01-14 01:17:16,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 01:17:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2019-01-14 01:17:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 01:17:16,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:17:16,950 INFO L402 BasicCegarLoop]: trace histogram [9, 7, 7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:17:16,950 INFO L423 AbstractCegarLoop]: === Iteration 20 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:17:16,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:17:16,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1845164003, now seen corresponding path program 5 times [2019-01-14 01:17:16,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:17:16,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:17:16,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:16,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:17:16,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:17:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:17:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 01:17:17,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:17:17,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:17:17,547 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:17:17,607 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-14 01:17:17,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:17:17,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:17:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-14 01:17:17,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:17:17,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2019-01-14 01:17:17,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 01:17:17,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 01:17:17,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:17:17,846 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand 20 states. [2019-01-14 01:17:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:17:17,962 INFO L93 Difference]: Finished difference Result 215 states and 251 transitions. [2019-01-14 01:17:17,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:17:17,971 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-01-14 01:17:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:17:17,972 INFO L225 Difference]: With dead ends: 215 [2019-01-14 01:17:17,972 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:17:17,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:17:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:17:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:17:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:17:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:17:17,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-01-14 01:17:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:17:17,977 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:17:17,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 01:17:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:17:17,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:17:17,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:17:18,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:18,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:18,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:18,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:18,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:18,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:17:18,410 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 20 [2019-01-14 01:17:18,620 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 17 [2019-01-14 01:17:18,622 INFO L448 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:17:18,623 INFO L448 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:17:18,623 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. [2019-01-14 01:17:18,623 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-01-14 01:17:18,623 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-01-14 01:17:18,624 INFO L444 ceAbstractionStarter]: At program point L15-2(line 15) the Hoare annotation is: (and (or (and (<= 0 g_~x) (<= g_~x 2147483647) (not (= 0 g_~x))) (< |g_#in~x| 0) (< 2147483647 |g_#in~x|)) (not (= |g_#in~x| 0))) [2019-01-14 01:17:18,624 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 15) no Hoare annotation was computed. [2019-01-14 01:17:18,624 INFO L448 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:17:18,624 INFO L448 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. [2019-01-14 01:17:18,624 INFO L448 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:17:18,624 INFO L448 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. [2019-01-14 01:17:18,624 INFO L448 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. [2019-01-14 01:17:18,625 INFO L444 ceAbstractionStarter]: At program point L15-6(line 15) the Hoare annotation is: (and (not (= |g_#in~x| 0)) (or (and (<= 0 g_~x) (= 1 |g_#t~ret0|) (<= g_~x 2147483647) (not (= 0 g_~x))) (< |g_#in~x| 0) (< 2147483647 |g_#in~x|))) [2019-01-14 01:17:18,625 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. [2019-01-14 01:17:18,625 INFO L448 ceAbstractionStarter]: For program point L15-7(line 15) no Hoare annotation was computed. [2019-01-14 01:17:18,625 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 10 16) the Hoare annotation is: true [2019-01-14 01:17:18,625 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:17:18,625 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:17:18,625 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:17:18,625 INFO L444 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0)) [2019-01-14 01:17:18,625 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 01:17:18,625 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-01-14 01:17:18,625 INFO L444 ceAbstractionStarter]: At program point L18(lines 18 22) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-14 01:17:18,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:17:18 BoogieIcfgContainer [2019-01-14 01:17:18,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:17:18,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:17:18,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:17:18,637 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:17:18,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:17:05" (3/4) ... [2019-01-14 01:17:18,640 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:17:18,645 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-01-14 01:17:18,651 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 01:17:18,652 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:17:18,695 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:17:18,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:17:18,696 INFO L168 Benchmark]: Toolchain (without parser) took 13758.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.7 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -204.7 MB). Peak memory consumption was 91.0 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:18,698 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:18,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.99 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:18,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.77 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:18,700 INFO L168 Benchmark]: Boogie Preprocessor took 19.13 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:17:18,701 INFO L168 Benchmark]: RCFGBuilder took 442.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:18,702 INFO L168 Benchmark]: TraceAbstraction took 12928.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -30.0 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:18,705 INFO L168 Benchmark]: Witness Printer took 59.07 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:17:18,709 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.99 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.77 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.13 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 442.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12928.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -30.0 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. * Witness Printer took 59.07 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: x <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 4 error locations. SAFE Result, 12.8s OverallTime, 20 OverallIterations, 9 TraceHistogramMax, 6.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 379 SDtfs, 673 SDslu, 1513 SDs, 0 SdLazy, 1575 SolverSat, 354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 380 SyntacticMatches, 4 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=12, 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.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 89 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 170 PreInvPairs, 188 NumberOfFragments, 64 HoareAnnotationTreeSize, 170 FomulaSimplifications, 631 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 401 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 907 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 76754 SizeOfPredicates, 30 NumberOfNonLiveVariables, 656 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 934/1271 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...