./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3_true-termination_true-no-overflow.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-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3_true-termination_true-no-overflow.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 500cb8735f650eb0e7c33062ddc23c2166b17f19 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:46:39,878 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:46:39,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:46:39,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:46:39,893 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:46:39,894 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:46:39,895 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:46:39,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:46:39,900 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:46:39,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:46:39,901 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:46:39,902 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:46:39,903 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:46:39,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:46:39,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:46:39,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:46:39,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:46:39,910 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:46:39,912 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:46:39,914 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:46:39,915 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:46:39,916 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:46:39,919 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:46:39,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:46:39,920 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:46:39,921 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:46:39,922 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:46:39,923 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:46:39,924 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:46:39,926 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:46:39,926 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:46:39,927 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:46:39,927 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:46:39,927 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:46:39,929 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:46:39,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:46:39,930 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:46:39,953 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:46:39,954 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:46:39,956 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:46:39,956 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:46:39,957 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:46:39,957 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:46:39,957 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:46:39,957 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:46:39,957 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:46:39,957 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:46:39,959 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:46:39,959 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:46:39,959 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:46:39,959 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:46:39,959 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:46:39,960 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:46:39,960 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:46:39,961 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:46:39,961 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:46:39,961 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:46:39,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:46:39,961 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:46:39,962 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:46:39,962 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:46:39,962 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:46:39,962 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:46:39,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:46:39,962 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 -> 500cb8735f650eb0e7c33062ddc23c2166b17f19 [2019-01-01 20:46:40,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:46:40,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:46:40,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:46:40,051 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:46:40,052 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:46:40,053 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3_true-termination_true-no-overflow.c [2019-01-01 20:46:40,117 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361b7d140/aec99aff0b5b4dca915e6702b2d3517b/FLAGfa0f61ebd [2019-01-01 20:46:40,564 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:46:40,565 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3_true-termination_true-no-overflow.c [2019-01-01 20:46:40,572 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361b7d140/aec99aff0b5b4dca915e6702b2d3517b/FLAGfa0f61ebd [2019-01-01 20:46:40,953 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/361b7d140/aec99aff0b5b4dca915e6702b2d3517b [2019-01-01 20:46:40,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:46:40,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:46:40,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:46:40,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:46:40,966 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:46:40,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:46:40" (1/1) ... [2019-01-01 20:46:40,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69949a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:46:40, skipping insertion in model container [2019-01-01 20:46:40,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:46:40" (1/1) ... [2019-01-01 20:46:40,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:46:41,000 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:46:41,235 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:46:41,242 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:46:41,266 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:46:41,284 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:46:41,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:46:41 WrapperNode [2019-01-01 20:46:41,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:46:41,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:46:41,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:46:41,287 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:46:41,298 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:46:41" (1/1) ... [2019-01-01 20:46:41,305 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:46:41" (1/1) ... [2019-01-01 20:46:41,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:46:41,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:46:41,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:46:41,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:46:41,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:46:41" (1/1) ... [2019-01-01 20:46:41,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:46:41" (1/1) ... [2019-01-01 20:46:41,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:46:41" (1/1) ... [2019-01-01 20:46:41,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:46:41" (1/1) ... [2019-01-01 20:46:41,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:46:41" (1/1) ... [2019-01-01 20:46:41,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:46:41" (1/1) ... [2019-01-01 20:46:41,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:46:41" (1/1) ... [2019-01-01 20:46:41,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:46:41,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:46:41,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:46:41,374 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:46:41,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:46:41" (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:46:41,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:46:41,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:46:41,816 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:46:41,816 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 20:46:41,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:46:41 BoogieIcfgContainer [2019-01-01 20:46:41,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:46:41,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:46:41,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:46:41,832 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:46:41,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:46:40" (1/3) ... [2019-01-01 20:46:41,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cccf004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:46:41, skipping insertion in model container [2019-01-01 20:46:41,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:46:41" (2/3) ... [2019-01-01 20:46:41,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cccf004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:46:41, skipping insertion in model container [2019-01-01 20:46:41,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:46:41" (3/3) ... [2019-01-01 20:46:41,839 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi3_true-termination_true-no-overflow.c [2019-01-01 20:46:41,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:46:41,864 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-01 20:46:41,886 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-01 20:46:41,957 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:46:41,957 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:46:41,958 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:46:41,958 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:46:41,958 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:46:41,958 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:46:41,958 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:46:41,958 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:46:41,959 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:46:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-01-01 20:46:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:46:41,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:46:41,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:46:41,986 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:46:41,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:46:41,993 INFO L82 PathProgramCache]: Analyzing trace with hash 29684842, now seen corresponding path program 1 times [2019-01-01 20:46:41,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:46:41,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:46:42,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:42,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:46:42,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:46:42,192 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:46:42,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:46:42,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:46:42,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:46:42,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:46:42,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:46:42,215 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2019-01-01 20:46:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:46:42,293 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-01-01 20:46:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:46:42,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 20:46:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:46:42,306 INFO L225 Difference]: With dead ends: 29 [2019-01-01 20:46:42,307 INFO L226 Difference]: Without dead ends: 16 [2019-01-01 20:46:42,311 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:46:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-01 20:46:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-01 20:46:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 20:46:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-01 20:46:42,350 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 5 [2019-01-01 20:46:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:46:42,351 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 20:46:42,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:46:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-01-01 20:46:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:46:42,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:46:42,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:46:42,352 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:46:42,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:46:42,353 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2019-01-01 20:46:42,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:46:42,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:46:42,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:42,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:46:42,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:46:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:46:42,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:46:42,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:46:42,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:46:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:46:42,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:46:42,391 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 3 states. [2019-01-01 20:46:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:46:42,496 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-01-01 20:46:42,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:46:42,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-01 20:46:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:46:42,499 INFO L225 Difference]: With dead ends: 30 [2019-01-01 20:46:42,499 INFO L226 Difference]: Without dead ends: 17 [2019-01-01 20:46:42,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:46:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-01 20:46:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-01 20:46:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 20:46:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-01 20:46:42,505 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 5 [2019-01-01 20:46:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:46:42,505 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-01 20:46:42,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:46:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-01 20:46:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:46:42,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:46:42,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:46:42,508 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:46:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:46:42,508 INFO L82 PathProgramCache]: Analyzing trace with hash 920230152, now seen corresponding path program 1 times [2019-01-01 20:46:42,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:46:42,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:46:42,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:42,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:46:42,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:46:42,556 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:46:42,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:46:42,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:46:42,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:46:42,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:46:42,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:46:42,558 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-01-01 20:46:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:46:42,604 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-01-01 20:46:42,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:46:42,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:46:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:46:42,605 INFO L225 Difference]: With dead ends: 17 [2019-01-01 20:46:42,606 INFO L226 Difference]: Without dead ends: 16 [2019-01-01 20:46:42,606 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:46:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-01 20:46:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-01 20:46:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 20:46:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-01-01 20:46:42,610 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 6 [2019-01-01 20:46:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:46:42,611 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-01-01 20:46:42,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:46:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-01-01 20:46:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:46:42,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:46:42,611 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-01 20:46:42,612 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:46:42,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:46:42,612 INFO L82 PathProgramCache]: Analyzing trace with hash -199749339, now seen corresponding path program 1 times [2019-01-01 20:46:42,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:46:42,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:46:42,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:42,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:46:42,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:46:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:46:42,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:46:42,695 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:46:42,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:46:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:46:42,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:46:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:46:42,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:46:42,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 20:46:42,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:46:42,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:46:42,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:46:42,763 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2019-01-01 20:46:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:46:42,886 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-01 20:46:42,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:46:42,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-01 20:46:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:46:42,888 INFO L225 Difference]: With dead ends: 22 [2019-01-01 20:46:42,888 INFO L226 Difference]: Without dead ends: 21 [2019-01-01 20:46:42,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:46:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-01 20:46:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-01 20:46:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 20:46:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-01-01 20:46:42,898 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2019-01-01 20:46:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:46:42,899 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-01 20:46:42,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:46:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-01-01 20:46:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:46:42,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:46:42,900 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:46:42,903 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:46:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:46:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash -199749147, now seen corresponding path program 1 times [2019-01-01 20:46:42,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:46:42,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:46:42,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:42,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:46:42,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:46:42,952 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:46:42,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:46:42,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:46:42,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:46:42,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:46:42,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:46:42,954 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 3 states. [2019-01-01 20:46:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:46:43,072 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-01-01 20:46:43,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:46:43,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-01 20:46:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:46:43,075 INFO L225 Difference]: With dead ends: 33 [2019-01-01 20:46:43,075 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 20:46:43,075 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:46:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 20:46:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-01 20:46:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 20:46:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-01-01 20:46:43,091 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 9 [2019-01-01 20:46:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:46:43,091 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-01-01 20:46:43,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:46:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-01-01 20:46:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:46:43,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:46:43,095 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:46:43,096 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:46:43,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:46:43,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1897256205, now seen corresponding path program 1 times [2019-01-01 20:46:43,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:46:43,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:46:43,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:43,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:46:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:46:43,198 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:46:43,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:46:43,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:46:43,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:46:43,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:46:43,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:46:43,203 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2019-01-01 20:46:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:46:43,236 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-01-01 20:46:43,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:46:43,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 20:46:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:46:43,240 INFO L225 Difference]: With dead ends: 30 [2019-01-01 20:46:43,240 INFO L226 Difference]: Without dead ends: 29 [2019-01-01 20:46:43,240 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:46:43,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-01 20:46:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-01 20:46:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 20:46:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-01-01 20:46:43,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 10 [2019-01-01 20:46:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:46:43,247 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-01 20:46:43,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:46:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-01-01 20:46:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 20:46:43,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:46:43,248 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2019-01-01 20:46:43,248 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:46:43,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:46:43,249 INFO L82 PathProgramCache]: Analyzing trace with hash 432560224, now seen corresponding path program 2 times [2019-01-01 20:46:43,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:46:43,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:46:43,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:43,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:46:43,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:46:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:46:43,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:46:43,362 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:46:43,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:46:43,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 20:46:43,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:46:43,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:46:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 20:46:43,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:46:43,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-01-01 20:46:43,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:46:43,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:46:43,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:46:43,504 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 8 states. [2019-01-01 20:46:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:46:43,799 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-01-01 20:46:43,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:46:43,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-01 20:46:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:46:43,804 INFO L225 Difference]: With dead ends: 43 [2019-01-01 20:46:43,804 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 20:46:43,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:46:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 20:46:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 16. [2019-01-01 20:46:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 20:46:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-01-01 20:46:43,811 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-01-01 20:46:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:46:43,811 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-01-01 20:46:43,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:46:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-01-01 20:46:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 20:46:43,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:46:43,812 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:46:43,812 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:46:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:46:43,813 INFO L82 PathProgramCache]: Analyzing trace with hash 610055194, now seen corresponding path program 1 times [2019-01-01 20:46:43,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:46:43,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:46:43,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:43,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:46:43,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:46:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:46:43,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:46:43,861 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:46:43,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:46:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:46:43,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:46:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:46:43,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:46:43,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2019-01-01 20:46:43,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:46:43,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:46:43,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:46:43,943 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 6 states. [2019-01-01 20:46:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:46:44,196 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-01-01 20:46:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:46:44,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-01 20:46:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:46:44,198 INFO L225 Difference]: With dead ends: 34 [2019-01-01 20:46:44,198 INFO L226 Difference]: Without dead ends: 27 [2019-01-01 20:46:44,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:46:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-01 20:46:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-01 20:46:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 20:46:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-01-01 20:46:44,206 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 13 [2019-01-01 20:46:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:46:44,206 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-01-01 20:46:44,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:46:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-01-01 20:46:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 20:46:44,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:46:44,208 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2019-01-01 20:46:44,208 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:46:44,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:46:44,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1201123269, now seen corresponding path program 2 times [2019-01-01 20:46:44,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:46:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:46:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:44,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:46:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:46:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:46:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-01 20:46:44,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:46:44,275 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:46:44,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:46:44,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 20:46:44,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:46:44,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:46:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-01-01 20:46:44,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:46:44,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2] total 6 [2019-01-01 20:46:44,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:46:44,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:46:44,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:46:44,505 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2019-01-01 20:46:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:46:44,727 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-01-01 20:46:44,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:46:44,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-01 20:46:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:46:44,728 INFO L225 Difference]: With dead ends: 36 [2019-01-01 20:46:44,728 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:46:44,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:46:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:46:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:46:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:46:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:46:44,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-01-01 20:46:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:46:44,730 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:46:44,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:46:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:46:44,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:46:44,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:46:44,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:46:44,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:46:44,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:46:44,977 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2019-01-01 20:46:44,980 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:46:44,980 INFO L451 ceAbstractionStarter]: At program point L29(lines 13 30) the Hoare annotation is: true [2019-01-01 20:46:44,980 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-01 20:46:44,980 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-01-01 20:46:44,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2019-01-01 20:46:44,981 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 26) no Hoare annotation was computed. [2019-01-01 20:46:44,981 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 20 27) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~m~0 2147483646)) (.cse1 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse2 (<= 0 ULTIMATE.start_main_~j~0)) (.cse3 (<= 0 ULTIMATE.start_main_~i~0))) (or (and .cse0 .cse1 (<= 1 ULTIMATE.start_main_~m~0) .cse2 (<= ULTIMATE.start_main_~i~0 2147483646) .cse3) (and .cse0 .cse1 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~m~0) .cse2 .cse3))) [2019-01-01 20:46:44,981 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 28) no Hoare annotation was computed. [2019-01-01 20:46:44,981 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 28) no Hoare annotation was computed. [2019-01-01 20:46:44,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:46:44,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:46:44,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-01 20:46:44,982 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-01 20:46:44,982 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-01-01 20:46:44,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2019-01-01 20:46:44,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-01 20:46:44,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:46:44 BoogieIcfgContainer [2019-01-01 20:46:44,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:46:44,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:46:44,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:46:44,999 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:46:44,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:46:41" (3/4) ... [2019-01-01 20:46:45,003 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:46:45,015 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 20:46:45,015 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:46:45,062 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:46:45,062 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:46:45,063 INFO L168 Benchmark]: Toolchain (without parser) took 4104.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 950.0 MB in the beginning and 928.6 MB in the end (delta: 21.4 MB). Peak memory consumption was 134.1 MB. Max. memory is 11.5 GB. [2019-01-01 20:46:45,064 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:46:45,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.81 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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:46:45,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.47 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:46:45,066 INFO L168 Benchmark]: Boogie Preprocessor took 40.54 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:46:45,066 INFO L168 Benchmark]: RCFGBuilder took 444.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-01 20:46:45,067 INFO L168 Benchmark]: TraceAbstraction took 3179.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 935.6 MB in the end (delta: 150.5 MB). Peak memory consumption was 150.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:46:45,068 INFO L168 Benchmark]: Witness Printer took 63.88 ms. Allocated memory is still 1.1 GB. Free memory was 935.6 MB in the beginning and 928.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-01 20:46:45,072 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 324.81 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.47 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.54 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 444.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3179.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 935.6 MB in the end (delta: 150.5 MB). Peak memory consumption was 150.5 MB. Max. memory is 11.5 GB. * Witness Printer took 63.88 ms. Allocated memory is still 1.1 GB. Free memory was 935.6 MB in the beginning and 928.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: 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: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((m <= 2147483646 && n <= 2147483647) && 1 <= m) && 0 <= j) && i <= 2147483646) && 0 <= i) || ((((m <= 2147483646 && n <= 2147483647) && j + 1 <= m) && 0 <= j) && 0 <= i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 4 error locations. SAFE Result, 3.0s OverallTime, 9 OverallIterations, 6 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 107 SDslu, 30 SDs, 0 SdLazy, 122 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=5, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 13 NumberOfFragments, 39 HoareAnnotationTreeSize, 2 FomulaSimplifications, 642 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 155 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 6042 SizeOfPredicates, 3 NumberOfNonLiveVariables, 100 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 56/124 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...