./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1b7166d94206693c3f254a3c1de8d5825f8510fb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:34:26,880 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:34:26,882 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:34:26,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:34:26,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:34:26,897 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:34:26,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:34:26,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:34:26,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:34:26,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:34:26,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:34:26,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:34:26,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:34:26,917 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:34:26,919 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:34:26,919 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:34:26,920 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:34:26,922 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:34:26,924 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:34:26,926 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:34:26,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:34:26,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:34:26,933 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:34:26,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:34:26,937 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:34:26,938 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:34:26,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:34:26,939 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:34:26,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:34:26,943 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:34:26,943 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:34:26,944 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:34:26,944 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:34:26,945 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:34:26,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:34:26,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:34:26,949 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:34:26,974 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:34:26,974 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:34:26,978 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:34:26,978 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:34:26,979 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:34:26,979 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:34:26,979 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:34:26,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:34:26,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:34:26,980 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:34:26,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:34:26,982 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:34:26,982 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:34:26,982 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:34:26,983 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:34:26,983 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:34:26,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:34:26,983 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:34:26,983 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:34:26,983 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:34:26,984 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:34:26,984 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:34:26,984 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:34:26,984 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:34:26,984 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:34:26,987 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:34:26,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:34:26,987 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 -> 1b7166d94206693c3f254a3c1de8d5825f8510fb [2019-01-01 20:34:27,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:34:27,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:34:27,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:34:27,065 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:34:27,065 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:34:27,066 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 20:34:27,118 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deec71a52/9314a373d9a74ca5a14c7c68d06b7c52/FLAGf34c2af0b [2019-01-01 20:34:27,519 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:34:27,520 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 20:34:27,526 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deec71a52/9314a373d9a74ca5a14c7c68d06b7c52/FLAGf34c2af0b [2019-01-01 20:34:27,899 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deec71a52/9314a373d9a74ca5a14c7c68d06b7c52 [2019-01-01 20:34:27,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:34:27,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:34:27,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:27,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:34:27,912 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:34:27,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:27" (1/1) ... [2019-01-01 20:34:27,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e727def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:27, skipping insertion in model container [2019-01-01 20:34:27,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:27" (1/1) ... [2019-01-01 20:34:27,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:34:27,945 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:34:28,158 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:28,163 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:34:28,181 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:28,197 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:34:28,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28 WrapperNode [2019-01-01 20:34:28,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:28,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:28,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:34:28,199 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:34:28,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (1/1) ... [2019-01-01 20:34:28,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (1/1) ... [2019-01-01 20:34:28,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:28,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:34:28,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:34:28,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:34:28,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (1/1) ... [2019-01-01 20:34:28,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (1/1) ... [2019-01-01 20:34:28,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (1/1) ... [2019-01-01 20:34:28,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (1/1) ... [2019-01-01 20:34:28,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (1/1) ... [2019-01-01 20:34:28,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (1/1) ... [2019-01-01 20:34:28,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (1/1) ... [2019-01-01 20:34:28,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:34:28,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:34:28,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:34:28,270 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:34:28,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:34:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 20:34:28,402 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 20:34:28,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:34:28,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:34:28,716 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:34:28,717 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 20:34:28,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:28 BoogieIcfgContainer [2019-01-01 20:34:28,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:34:28,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:34:28,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:34:28,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:34:28,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:34:27" (1/3) ... [2019-01-01 20:34:28,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8be188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:28, skipping insertion in model container [2019-01-01 20:34:28,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (2/3) ... [2019-01-01 20:34:28,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8be188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:28, skipping insertion in model container [2019-01-01 20:34:28,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:28" (3/3) ... [2019-01-01 20:34:28,729 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2b_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 20:34:28,740 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:34:28,748 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-01 20:34:28,767 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-01 20:34:28,800 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:34:28,801 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:34:28,801 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:34:28,802 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:34:28,802 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:34:28,802 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:34:28,802 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:34:28,802 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:34:28,802 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:34:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-01-01 20:34:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:34:28,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:28,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:34:28,832 INFO L423 AbstractCegarLoop]: === Iteration 1 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:28,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:28,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1454635077, now seen corresponding path program 1 times [2019-01-01 20:34:28,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:28,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:28,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:28,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:29,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:29,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:29,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:29,237 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-01-01 20:34:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:29,624 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-01-01 20:34:29,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:29,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-01 20:34:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:29,637 INFO L225 Difference]: With dead ends: 41 [2019-01-01 20:34:29,637 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 20:34:29,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 20:34:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-01-01 20:34:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 20:34:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-01-01 20:34:29,686 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 6 [2019-01-01 20:34:29,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:29,687 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-01 20:34:29,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:29,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-01-01 20:34:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 20:34:29,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:29,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:29,688 INFO L423 AbstractCegarLoop]: === Iteration 2 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:29,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2144014465, now seen corresponding path program 1 times [2019-01-01 20:34:29,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:29,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:29,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:29,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:29,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:29,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:29,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:29,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:29,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:29,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:29,772 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2019-01-01 20:34:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:30,114 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-01-01 20:34:30,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:30,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-01 20:34:30,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:30,122 INFO L225 Difference]: With dead ends: 50 [2019-01-01 20:34:30,122 INFO L226 Difference]: Without dead ends: 46 [2019-01-01 20:34:30,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-01 20:34:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2019-01-01 20:34:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 20:34:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-01-01 20:34:30,149 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 7 [2019-01-01 20:34:30,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:30,149 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-01 20:34:30,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-01-01 20:34:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 20:34:30,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:30,151 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:30,151 INFO L423 AbstractCegarLoop]: === Iteration 3 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:30,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:30,151 INFO L82 PathProgramCache]: Analyzing trace with hash -736378463, now seen corresponding path program 1 times [2019-01-01 20:34:30,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:30,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:30,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:30,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:30,319 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-01 20:34:30,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:30,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:30,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:30,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:30,383 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-01 20:34:30,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:30,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:34:30,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:34:30,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:34:30,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:30,404 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 7 states. [2019-01-01 20:34:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:30,734 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2019-01-01 20:34:30,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:34:30,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-01 20:34:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:30,737 INFO L225 Difference]: With dead ends: 63 [2019-01-01 20:34:30,737 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 20:34:30,738 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-01 20:34:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 20:34:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-01-01 20:34:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 20:34:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2019-01-01 20:34:30,752 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 12 [2019-01-01 20:34:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:30,753 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2019-01-01 20:34:30,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:34:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2019-01-01 20:34:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 20:34:30,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:30,755 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:30,756 INFO L423 AbstractCegarLoop]: === Iteration 4 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1009328462, now seen corresponding path program 1 times [2019-01-01 20:34:30,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:30,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:30,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:30,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:30,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:30,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:30,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:30,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:30,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:30,811 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 4 states. [2019-01-01 20:34:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:30,849 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2019-01-01 20:34:30,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:34:30,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-01 20:34:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:30,856 INFO L225 Difference]: With dead ends: 78 [2019-01-01 20:34:30,857 INFO L226 Difference]: Without dead ends: 77 [2019-01-01 20:34:30,857 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-01 20:34:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-01 20:34:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2019-01-01 20:34:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-01 20:34:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-01-01 20:34:30,890 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 14 [2019-01-01 20:34:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:30,890 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-01-01 20:34:30,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-01-01 20:34:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 20:34:30,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:30,895 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:30,895 INFO L423 AbstractCegarLoop]: === Iteration 5 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:30,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1224411294, now seen corresponding path program 1 times [2019-01-01 20:34:30,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:30,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:30,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:30,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:30,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:30,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:30,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:30,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:30,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:30,938 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-01-01 20:34:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:30,956 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2019-01-01 20:34:30,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:30,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-01 20:34:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:30,960 INFO L225 Difference]: With dead ends: 66 [2019-01-01 20:34:30,960 INFO L226 Difference]: Without dead ends: 65 [2019-01-01 20:34:30,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-01 20:34:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-01 20:34:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 20:34:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2019-01-01 20:34:30,973 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 15 [2019-01-01 20:34:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:30,973 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-01-01 20:34:30,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2019-01-01 20:34:30,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 20:34:30,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:30,976 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-01 20:34:30,976 INFO L423 AbstractCegarLoop]: === Iteration 6 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:30,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:30,976 INFO L82 PathProgramCache]: Analyzing trace with hash -231947135, now seen corresponding path program 2 times [2019-01-01 20:34:30,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:30,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:30,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:30,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:31,091 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-01 20:34:31,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:31,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:31,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:31,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:31,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:31,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:31,152 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-01 20:34:31,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:31,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:34:31,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:34:31,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:34:31,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:34:31,185 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 9 states. [2019-01-01 20:34:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:31,700 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2019-01-01 20:34:31,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:34:31,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-01 20:34:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:31,703 INFO L225 Difference]: With dead ends: 85 [2019-01-01 20:34:31,703 INFO L226 Difference]: Without dead ends: 84 [2019-01-01 20:34:31,703 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-01 20:34:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-01 20:34:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-01 20:34:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-01 20:34:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2019-01-01 20:34:31,727 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 17 [2019-01-01 20:34:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:31,728 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-01-01 20:34:31,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:34:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2019-01-01 20:34:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 20:34:31,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:31,729 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:31,730 INFO L423 AbstractCegarLoop]: === Iteration 7 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:31,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:31,730 INFO L82 PathProgramCache]: Analyzing trace with hash -855233152, now seen corresponding path program 1 times [2019-01-01 20:34:31,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:31,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:31,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:31,824 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-01 20:34:31,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:31,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:34:31,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:34:31,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:34:31,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:31,829 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 6 states. [2019-01-01 20:34:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:32,089 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2019-01-01 20:34:32,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:34:32,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-01 20:34:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:32,092 INFO L225 Difference]: With dead ends: 117 [2019-01-01 20:34:32,092 INFO L226 Difference]: Without dead ends: 116 [2019-01-01 20:34:32,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-01 20:34:32,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-01-01 20:34:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 20:34:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-01-01 20:34:32,112 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 19 [2019-01-01 20:34:32,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:32,116 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-01-01 20:34:32,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:34:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2019-01-01 20:34:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 20:34:32,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:32,117 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:32,117 INFO L423 AbstractCegarLoop]: === Iteration 8 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:32,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:32,119 INFO L82 PathProgramCache]: Analyzing trace with hash -742423898, now seen corresponding path program 1 times [2019-01-01 20:34:32,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:32,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:32,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:32,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:32,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:32,197 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-01 20:34:32,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:32,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:34:32,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:34:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:34:32,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:32,199 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 6 states. [2019-01-01 20:34:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:32,330 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2019-01-01 20:34:32,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:32,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-01 20:34:32,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:32,332 INFO L225 Difference]: With dead ends: 130 [2019-01-01 20:34:32,332 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 20:34:32,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:34:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 20:34:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 35. [2019-01-01 20:34:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 20:34:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-01-01 20:34:32,348 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 20 [2019-01-01 20:34:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:32,350 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-01-01 20:34:32,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:34:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-01-01 20:34:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 20:34:32,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:32,352 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-01-01 20:34:32,352 INFO L423 AbstractCegarLoop]: === Iteration 9 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:32,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:32,356 INFO L82 PathProgramCache]: Analyzing trace with hash -559247967, now seen corresponding path program 3 times [2019-01-01 20:34:32,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:32,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:32,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:32,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:32,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:32,541 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-01 20:34:32,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:32,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:32,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:32,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:34:32,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:32,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:32,586 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-01 20:34:32,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:32,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:34:32,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:34:32,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:34:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:32,609 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2019-01-01 20:34:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:33,247 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-01-01 20:34:33,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 20:34:33,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-01 20:34:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:33,249 INFO L225 Difference]: With dead ends: 62 [2019-01-01 20:34:33,249 INFO L226 Difference]: Without dead ends: 61 [2019-01-01 20:34:33,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:34:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-01 20:34:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2019-01-01 20:34:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 20:34:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-01 20:34:33,259 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 22 [2019-01-01 20:34:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:33,260 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-01 20:34:33,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:34:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-01 20:34:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 20:34:33,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:33,263 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:33,263 INFO L423 AbstractCegarLoop]: === Iteration 10 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:33,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:33,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1606295908, now seen corresponding path program 2 times [2019-01-01 20:34:33,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:33,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:33,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:33,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:33,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:33,419 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-01 20:34:33,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:33,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:33,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:33,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:33,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:33,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:33,452 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-01 20:34:33,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:33,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 20:34:33,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:34:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:34:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:34:33,473 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2019-01-01 20:34:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:33,604 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-01-01 20:34:33,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:34:33,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-01-01 20:34:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:33,606 INFO L225 Difference]: With dead ends: 70 [2019-01-01 20:34:33,606 INFO L226 Difference]: Without dead ends: 54 [2019-01-01 20:34:33,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-01 20:34:33,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-01-01 20:34:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 20:34:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-01-01 20:34:33,613 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 25 [2019-01-01 20:34:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:33,615 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-01-01 20:34:33,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:34:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-01-01 20:34:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 20:34:33,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:33,616 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-01 20:34:33,616 INFO L423 AbstractCegarLoop]: === Iteration 11 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:33,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:33,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1828550785, now seen corresponding path program 4 times [2019-01-01 20:34:33,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:33,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:33,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:33,803 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-01 20:34:33,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:33,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:33,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:33,823 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:33,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:33,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:33,981 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-01 20:34:34,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:34,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-01-01 20:34:34,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 20:34:34,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 20:34:34,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:34:34,002 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 14 states. [2019-01-01 20:34:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:34,156 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-01-01 20:34:34,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:34,157 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-01 20:34:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:34,159 INFO L225 Difference]: With dead ends: 61 [2019-01-01 20:34:34,159 INFO L226 Difference]: Without dead ends: 60 [2019-01-01 20:34:34,161 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-01 20:34:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-01 20:34:34,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 33. [2019-01-01 20:34:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 20:34:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-01-01 20:34:34,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 27 [2019-01-01 20:34:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:34,172 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-01-01 20:34:34,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 20:34:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-01-01 20:34:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 20:34:34,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:34,173 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:34,178 INFO L423 AbstractCegarLoop]: === Iteration 12 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:34,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:34,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1103662182, now seen corresponding path program 3 times [2019-01-01 20:34:34,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:34,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:34,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:34,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:34,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:34,319 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-01 20:34:34,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:34,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:34,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:34,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-01 20:34:34,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:34,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:34,382 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-01 20:34:34,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:34,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 20:34:34,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:34:34,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:34:34,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:34,412 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 10 states. [2019-01-01 20:34:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:34,631 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-01-01 20:34:34,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 20:34:34,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-01-01 20:34:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:34,633 INFO L225 Difference]: With dead ends: 42 [2019-01-01 20:34:34,633 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:34:34,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:34:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:34:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:34:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:34:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:34:34,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-01-01 20:34:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:34,637 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:34:34,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:34:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:34:34,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:34:34,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:34:34,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:34,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:35,210 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 1 [2019-01-01 20:34:36,554 WARN L181 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 85 DAG size of output: 26 [2019-01-01 20:34:36,681 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 23 [2019-01-01 20:34:36,684 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. [2019-01-01 20:34:36,684 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-01-01 20:34:36,684 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-01-01 20:34:36,685 INFO L444 ceAbstractionStarter]: At program point L15-2(line 15) the Hoare annotation is: (and (or (or (< 2147483647 |g_#in~x|) (< |g_#in~x| 0)) (and (<= 0 g_~x) (<= g_~x 2147483647) (not (= 0 g_~x)))) (or (<= 2 g_~x) (< |g_#in~x| 2) (< 2 |g_#in~x|))) [2019-01-01 20:34:36,685 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 15) no Hoare annotation was computed. [2019-01-01 20:34:36,685 INFO L448 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. [2019-01-01 20:34:36,685 INFO L448 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. [2019-01-01 20:34:36,685 INFO L448 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. [2019-01-01 20:34:36,685 INFO L448 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-01 20:34:36,686 INFO L444 ceAbstractionStarter]: At program point L15-6(line 15) the Hoare annotation is: (let ((.cse0 (< 2147483647 |g_#in~x|)) (.cse1 (< |g_#in~x| 0))) (and (or (and (and (<= g_~x 2147483647) (<= |g_#t~ret0| 1)) (<= 1 |g_#t~ret0|)) (or .cse0 .cse1)) (or (< |g_#in~x| 2) (< 2 |g_#in~x|)) (or (<= 1 g_~x) .cse0 .cse1))) [2019-01-01 20:34:36,686 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. [2019-01-01 20:34:36,686 INFO L448 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-01 20:34:36,686 INFO L448 ceAbstractionStarter]: For program point L15-7(line 15) no Hoare annotation was computed. [2019-01-01 20:34:36,686 INFO L448 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-01 20:34:36,686 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 10 16) the Hoare annotation is: true [2019-01-01 20:34:36,686 INFO L448 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-01 20:34:36,686 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:34:36,687 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:34:36,687 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:34:36,687 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-01 20:34:36,687 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-01 20:34:36,687 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-01-01 20:34:36,687 INFO L444 ceAbstractionStarter]: At program point L18(lines 18 22) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-01 20:34:36,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:34:36 BoogieIcfgContainer [2019-01-01 20:34:36,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:34:36,700 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:34:36,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:34:36,700 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:34:36,700 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:28" (3/4) ... [2019-01-01 20:34:36,706 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:34:36,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-01-01 20:34:36,718 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 20:34:36,718 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:34:36,771 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:34:36,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:34:36,772 INFO L168 Benchmark]: Toolchain (without parser) took 8867.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -85.3 MB). Peak memory consumption was 110.8 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:36,773 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:36,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.02 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:36,776 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.78 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:36,776 INFO L168 Benchmark]: Boogie Preprocessor took 27.73 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:36,777 INFO L168 Benchmark]: RCFGBuilder took 447.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:36,778 INFO L168 Benchmark]: TraceAbstraction took 7980.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.0 MB). Peak memory consumption was 129.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:36,779 INFO L168 Benchmark]: Witness Printer took 71.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:36,784 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.02 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 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 42.78 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.73 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 447.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7980.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.0 MB). Peak memory consumption was 129.5 MB. Max. memory is 11.5 GB. * Witness Printer took 71.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. 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, 7.8s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 199 SDtfs, 353 SDslu, 618 SDs, 0 SdLazy, 618 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 134 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 126 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 62 PreInvPairs, 67 NumberOfFragments, 88 HoareAnnotationTreeSize, 62 FomulaSimplifications, 18128 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 5 FomulaSimplificationsInter, 4818 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 329 ConstructedInterpolants, 0 QuantifiedInterpolants, 21879 SizeOfPredicates, 19 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 131/307 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...