./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/recursive/EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/recursive/EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash bec5669c6fe02e51518958076fea4487ada345cf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:04:54,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:04:54,816 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:04:54,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:04:54,833 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:04:54,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:04:54,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:04:54,839 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:04:54,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:04:54,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:04:54,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:04:54,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:04:54,845 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:04:54,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:04:54,848 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:04:54,852 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:04:54,854 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:04:54,857 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:04:54,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:04:54,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:04:54,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:04:54,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:04:54,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:04:54,873 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:04:54,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:04:54,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:04:54,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:04:54,876 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:04:54,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:04:54,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:04:54,879 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:04:54,881 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:04:54,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:04:54,882 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:04:54,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:04:54,883 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:04:54,884 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-01 21:04:54,908 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:04:54,908 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:04:54,910 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:04:54,910 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:04:54,911 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:04:54,911 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:04:54,911 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 21:04:54,911 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:04:54,911 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:04:54,912 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 21:04:54,913 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:04:54,913 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 21:04:54,913 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 21:04:54,913 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 21:04:54,913 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 21:04:54,914 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 21:04:54,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:04:54,914 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:04:54,914 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 21:04:54,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:04:54,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:04:54,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 21:04:54,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 21:04:54,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 21:04:54,915 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:04:54,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 21:04:54,915 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 21:04:54,917 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:04:54,917 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 21:04:54,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 21:04:54,918 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bec5669c6fe02e51518958076fea4487ada345cf [2019-01-01 21:04:54,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:04:54,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:04:54,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:04:54,986 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:04:54,987 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:04:54,987 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 21:04:55,040 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc591ba7/dc1a51d8dcb34ae1a67212974bac8cd2/FLAGe73c274f3 [2019-01-01 21:04:55,503 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:04:55,504 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 21:04:55,511 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc591ba7/dc1a51d8dcb34ae1a67212974bac8cd2/FLAGe73c274f3 [2019-01-01 21:04:55,838 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc591ba7/dc1a51d8dcb34ae1a67212974bac8cd2 [2019-01-01 21:04:55,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:04:55,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:04:55,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:04:55,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:04:55,848 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:04:55,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:04:55" (1/1) ... [2019-01-01 21:04:55,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bbc90c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:55, skipping insertion in model container [2019-01-01 21:04:55,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:04:55" (1/1) ... [2019-01-01 21:04:55,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:04:55,883 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:04:56,044 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:04:56,049 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:04:56,069 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:04:56,086 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:04:56,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56 WrapperNode [2019-01-01 21:04:56,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:04:56,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:04:56,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:04:56,088 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:04:56,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56" (1/1) ... [2019-01-01 21:04:56,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56" (1/1) ... [2019-01-01 21:04:56,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:04:56,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:04:56,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:04:56,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:04:56,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56" (1/1) ... [2019-01-01 21:04:56,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56" (1/1) ... [2019-01-01 21:04:56,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56" (1/1) ... [2019-01-01 21:04:56,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56" (1/1) ... [2019-01-01 21:04:56,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56" (1/1) ... [2019-01-01 21:04:56,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56" (1/1) ... [2019-01-01 21:04:56,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56" (1/1) ... [2019-01-01 21:04:56,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:04:56,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:04:56,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:04:56,152 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:04:56,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56" (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 21:04:56,293 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2019-01-01 21:04:56,295 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2019-01-01 21:04:56,295 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2019-01-01 21:04:56,295 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2019-01-01 21:04:56,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:04:56,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:04:56,772 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:04:56,772 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 21:04:56,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:04:56 BoogieIcfgContainer [2019-01-01 21:04:56,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:04:56,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 21:04:56,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 21:04:56,777 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 21:04:56,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 09:04:55" (1/3) ... [2019-01-01 21:04:56,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d579b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:04:56, skipping insertion in model container [2019-01-01 21:04:56,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:04:56" (2/3) ... [2019-01-01 21:04:56,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d579b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:04:56, skipping insertion in model container [2019-01-01 21:04:56,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:04:56" (3/3) ... [2019-01-01 21:04:56,781 INFO L112 eAbstractionObserver]: Analyzing ICFG EvenOdd01_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 21:04:56,792 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 21:04:56,800 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-01 21:04:56,818 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-01 21:04:56,854 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:04:56,855 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 21:04:56,855 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 21:04:56,856 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 21:04:56,856 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:04:56,856 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:04:56,857 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 21:04:56,857 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:04:56,857 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 21:04:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-01 21:04:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 21:04:56,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:04:56,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:04:56,888 INFO L423 AbstractCegarLoop]: === Iteration 1 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:04:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:04:56,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2104858774, now seen corresponding path program 1 times [2019-01-01 21:04:56,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:04:56,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:04:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:56,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:04:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:04:57,099 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 21:04:57,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:04:57,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:04:57,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:04:57,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:04:57,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:04:57,122 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2019-01-01 21:04:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:04:57,316 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-01-01 21:04:57,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:04:57,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-01 21:04:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:04:57,330 INFO L225 Difference]: With dead ends: 47 [2019-01-01 21:04:57,330 INFO L226 Difference]: Without dead ends: 26 [2019-01-01 21:04:57,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:04:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-01 21:04:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-01-01 21:04:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 21:04:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-01 21:04:57,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 7 [2019-01-01 21:04:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:04:57,369 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-01 21:04:57,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:04:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-01 21:04:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 21:04:57,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:04:57,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:04:57,370 INFO L423 AbstractCegarLoop]: === Iteration 2 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:04:57,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:04:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash 826112612, now seen corresponding path program 1 times [2019-01-01 21:04:57,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:04:57,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:04:57,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:57,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:04:57,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:04:57,464 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 21:04:57,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:04:57,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:04:57,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:04:57,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:04:57,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:04:57,467 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2019-01-01 21:04:57,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:04:57,709 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-01 21:04:57,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:04:57,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-01 21:04:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:04:57,711 INFO L225 Difference]: With dead ends: 26 [2019-01-01 21:04:57,711 INFO L226 Difference]: Without dead ends: 25 [2019-01-01 21:04:57,712 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 21:04:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-01 21:04:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-01 21:04:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:04:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-01 21:04:57,721 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 8 [2019-01-01 21:04:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:04:57,721 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-01 21:04:57,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:04:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-01 21:04:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 21:04:57,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:04:57,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:04:57,723 INFO L423 AbstractCegarLoop]: === Iteration 3 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:04:57,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:04:57,723 INFO L82 PathProgramCache]: Analyzing trace with hash -345822603, now seen corresponding path program 1 times [2019-01-01 21:04:57,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:04:57,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:04:57,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:57,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:04:57,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:04:57,802 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 21:04:57,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:04:57,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:04:57,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:04:57,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:04:57,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:04:57,804 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 5 states. [2019-01-01 21:04:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:04:57,914 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-01 21:04:57,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:04:57,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-01 21:04:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:04:57,918 INFO L225 Difference]: With dead ends: 24 [2019-01-01 21:04:57,918 INFO L226 Difference]: Without dead ends: 23 [2019-01-01 21:04:57,919 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 21:04:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-01 21:04:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-01 21:04:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 21:04:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-01 21:04:57,925 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 13 [2019-01-01 21:04:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:04:57,925 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-01 21:04:57,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:04:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-01 21:04:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 21:04:57,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:04:57,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:04:57,928 INFO L423 AbstractCegarLoop]: === Iteration 4 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:04:57,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:04:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2130566059, now seen corresponding path program 1 times [2019-01-01 21:04:57,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:04:57,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:04:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:57,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:04:57,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:04:58,045 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 21:04:58,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:04:58,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 21:04:58,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 21:04:58,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:04:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:04:58,048 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2019-01-01 21:04:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:04:58,278 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-01 21:04:58,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:04:58,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-01-01 21:04:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:04:58,282 INFO L225 Difference]: With dead ends: 31 [2019-01-01 21:04:58,282 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 21:04:58,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:04:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 21:04:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-01 21:04:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 21:04:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-01 21:04:58,290 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 14 [2019-01-01 21:04:58,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:04:58,290 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-01 21:04:58,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 21:04:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-01 21:04:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 21:04:58,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:04:58,292 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:04:58,292 INFO L423 AbstractCegarLoop]: === Iteration 5 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:04:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:04:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash -733256670, now seen corresponding path program 1 times [2019-01-01 21:04:58,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:04:58,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:04:58,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:58,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:04:58,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:04:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:04:58,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:04:58,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:04:58,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:04:58,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:04:58,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:04:58,347 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 5 states. [2019-01-01 21:04:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:04:58,404 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-01 21:04:58,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:04:58,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-01 21:04:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:04:58,408 INFO L225 Difference]: With dead ends: 29 [2019-01-01 21:04:58,408 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 21:04:58,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:04:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 21:04:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-01 21:04:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 21:04:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-01 21:04:58,416 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-01-01 21:04:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:04:58,417 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-01 21:04:58,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:04:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-01 21:04:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 21:04:58,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:04:58,419 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:04:58,419 INFO L423 AbstractCegarLoop]: === Iteration 6 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:04:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:04:58,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1256120232, now seen corresponding path program 1 times [2019-01-01 21:04:58,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:04:58,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:04:58,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:58,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:04:58,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:04:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:04:58,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:04:58,901 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 21:04:58,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:04:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:04:58,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:04:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:04:59,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:04:59,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 21:04:59,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 21:04:59,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:04:59,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:04:59,004 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2019-01-01 21:04:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:04:59,286 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-01 21:04:59,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:04:59,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-01 21:04:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:04:59,287 INFO L225 Difference]: With dead ends: 36 [2019-01-01 21:04:59,287 INFO L226 Difference]: Without dead ends: 35 [2019-01-01 21:04:59,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-01-01 21:04:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-01 21:04:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-01 21:04:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 21:04:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-01 21:04:59,295 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 20 [2019-01-01 21:04:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:04:59,295 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-01 21:04:59,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 21:04:59,296 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-01 21:04:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 21:04:59,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:04:59,298 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:04:59,298 INFO L423 AbstractCegarLoop]: === Iteration 7 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:04:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:04:59,299 INFO L82 PathProgramCache]: Analyzing trace with hash 507937609, now seen corresponding path program 1 times [2019-01-01 21:04:59,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:04:59,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:04:59,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:59,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:04:59,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:04:59,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:04:59,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:04:59,477 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 21:04:59,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:04:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:04:59,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:04:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:04:59,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:04:59,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 21:04:59,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 21:04:59,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 21:04:59,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:04:59,547 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 11 states. [2019-01-01 21:04:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:04:59,800 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-01 21:04:59,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:04:59,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-01-01 21:04:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:04:59,803 INFO L225 Difference]: With dead ends: 42 [2019-01-01 21:04:59,803 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 21:04:59,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-01-01 21:04:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 21:04:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-01 21:04:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 21:04:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-01 21:04:59,811 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 26 [2019-01-01 21:04:59,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:04:59,811 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-01 21:04:59,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 21:04:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-01 21:04:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 21:04:59,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:04:59,815 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 21:04:59,815 INFO L423 AbstractCegarLoop]: === Iteration 8 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:04:59,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:04:59,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1150777420, now seen corresponding path program 2 times [2019-01-01 21:04:59,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:04:59,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:04:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:04:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:04:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:00,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:00,109 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 21:05:00,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:05:00,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:05:00,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:00,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:00,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:00,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-01 21:05:00,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 21:05:00,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 21:05:00,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-01 21:05:00,177 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 13 states. [2019-01-01 21:05:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:00,662 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-01 21:05:00,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 21:05:00,663 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-01-01 21:05:00,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:00,665 INFO L225 Difference]: With dead ends: 48 [2019-01-01 21:05:00,665 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 21:05:00,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-01-01 21:05:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 21:05:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-01 21:05:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 21:05:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-01 21:05:00,685 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 32 [2019-01-01 21:05:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:00,685 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-01 21:05:00,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 21:05:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-01 21:05:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 21:05:00,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:00,691 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-01 21:05:00,691 INFO L423 AbstractCegarLoop]: === Iteration 9 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:00,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:00,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1724912701, now seen corresponding path program 2 times [2019-01-01 21:05:00,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:00,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:00,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:00,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:00,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:00,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:00,930 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 21:05:00,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:05:00,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:05:00,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:00,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:01,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:01,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-01 21:05:01,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 21:05:01,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 21:05:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-01-01 21:05:01,006 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 15 states. [2019-01-01 21:05:01,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:01,534 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-01 21:05:01,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 21:05:01,535 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2019-01-01 21:05:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:01,537 INFO L225 Difference]: With dead ends: 54 [2019-01-01 21:05:01,537 INFO L226 Difference]: Without dead ends: 53 [2019-01-01 21:05:01,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-01-01 21:05:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-01 21:05:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-01-01 21:05:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 21:05:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-01 21:05:01,555 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 38 [2019-01-01 21:05:01,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:01,555 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-01 21:05:01,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 21:05:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-01 21:05:01,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 21:05:01,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:01,557 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-01-01 21:05:01,557 INFO L423 AbstractCegarLoop]: === Iteration 10 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:01,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:01,558 INFO L82 PathProgramCache]: Analyzing trace with hash 790987328, now seen corresponding path program 3 times [2019-01-01 21:05:01,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:01,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:01,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:01,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:01,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:01,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:01,888 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 21:05:01,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:05:01,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 21:05:01,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:01,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:02,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:02,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-01 21:05:02,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 21:05:02,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 21:05:02,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-01-01 21:05:02,063 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 17 states. [2019-01-01 21:05:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:02,353 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-01 21:05:02,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 21:05:02,354 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2019-01-01 21:05:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:02,356 INFO L225 Difference]: With dead ends: 60 [2019-01-01 21:05:02,356 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 21:05:02,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-01-01 21:05:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 21:05:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-01-01 21:05:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 21:05:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-01 21:05:02,365 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 44 [2019-01-01 21:05:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:02,365 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-01 21:05:02,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 21:05:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-01 21:05:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 21:05:02,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:02,367 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-01-01 21:05:02,367 INFO L423 AbstractCegarLoop]: === Iteration 11 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash 845403953, now seen corresponding path program 3 times [2019-01-01 21:05:02,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:02,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:02,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:02,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:02,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:02,640 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 21:05:02,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:05:02,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 21:05:02,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:02,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:02,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:02,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-01 21:05:02,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-01 21:05:02,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 21:05:02,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-01-01 21:05:02,729 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 19 states. [2019-01-01 21:05:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:03,029 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-01 21:05:03,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 21:05:03,031 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2019-01-01 21:05:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:03,031 INFO L225 Difference]: With dead ends: 66 [2019-01-01 21:05:03,032 INFO L226 Difference]: Without dead ends: 65 [2019-01-01 21:05:03,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-01-01 21:05:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-01 21:05:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-01-01 21:05:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 21:05:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-01 21:05:03,040 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 50 [2019-01-01 21:05:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:03,041 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-01 21:05:03,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-01 21:05:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-01 21:05:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 21:05:03,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:03,042 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-01-01 21:05:03,043 INFO L423 AbstractCegarLoop]: === Iteration 12 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:03,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:03,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1529856460, now seen corresponding path program 4 times [2019-01-01 21:05:03,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:03,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:03,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:03,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:03,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:03,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:03,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:05:03,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:05:03,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:05:03,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:03,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-01 21:05:03,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:03,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 24 [2019-01-01 21:05:03,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-01 21:05:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 21:05:03,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-01-01 21:05:03,629 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 25 states. [2019-01-01 21:05:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:03,887 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-01 21:05:03,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 21:05:03,888 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2019-01-01 21:05:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:03,889 INFO L225 Difference]: With dead ends: 64 [2019-01-01 21:05:03,889 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 21:05:03,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-01-01 21:05:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 21:05:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 21:05:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 21:05:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:05:03,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-01-01 21:05:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:03,894 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:05:03,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-01 21:05:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:05:03,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 21:05:03,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 21:05:04,548 WARN L181 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 17 [2019-01-01 21:05:04,877 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 12 [2019-01-01 21:05:04,888 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-01-01 21:05:04,888 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2019-01-01 21:05:04,889 INFO L444 ceAbstractionStarter]: At program point L32-2(line 32) the Hoare annotation is: (or (and (<= 1 isEven_~n) (<= isEven_~n 2147483647)) (< |isEven_#in~n| 1) (< 2147483647 |isEven_#in~n|)) [2019-01-01 21:05:04,889 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2019-01-01 21:05:04,889 INFO L448 ceAbstractionStarter]: For program point L32-3(line 32) no Hoare annotation was computed. [2019-01-01 21:05:04,889 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 33) no Hoare annotation was computed. [2019-01-01 21:05:04,889 INFO L448 ceAbstractionStarter]: For program point isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2019-01-01 21:05:04,889 INFO L448 ceAbstractionStarter]: For program point isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2019-01-01 21:05:04,890 INFO L451 ceAbstractionStarter]: At program point isEvenENTRY(lines 26 34) the Hoare annotation is: true [2019-01-01 21:05:04,890 INFO L448 ceAbstractionStarter]: For program point isEvenEXIT(lines 26 34) no Hoare annotation was computed. [2019-01-01 21:05:04,890 INFO L448 ceAbstractionStarter]: For program point isEvenFINAL(lines 26 34) no Hoare annotation was computed. [2019-01-01 21:05:04,890 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-01 21:05:04,890 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-01-01 21:05:04,890 INFO L444 ceAbstractionStarter]: At program point L22-2(line 22) the Hoare annotation is: (or (< 2147483647 |isOdd_#in~n|) (and (not (= isOdd_~n 0)) (<= isOdd_~n 2147483647) (<= 0 isOdd_~n) (not (= isOdd_~n 1))) (< |isOdd_#in~n| 0)) [2019-01-01 21:05:04,890 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2019-01-01 21:05:04,890 INFO L448 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2019-01-01 21:05:04,890 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 23) no Hoare annotation was computed. [2019-01-01 21:05:04,890 INFO L448 ceAbstractionStarter]: For program point isOddFINAL(lines 16 24) no Hoare annotation was computed. [2019-01-01 21:05:04,891 INFO L448 ceAbstractionStarter]: For program point isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-01 21:05:04,891 INFO L451 ceAbstractionStarter]: At program point isOddENTRY(lines 16 24) the Hoare annotation is: true [2019-01-01 21:05:04,891 INFO L448 ceAbstractionStarter]: For program point isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-01 21:05:04,891 INFO L448 ceAbstractionStarter]: For program point isOddEXIT(lines 16 24) no Hoare annotation was computed. [2019-01-01 21:05:04,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 21:05:04,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 21:05:04,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 21:05:04,891 INFO L448 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-01-01 21:05:04,891 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 48) no Hoare annotation was computed. [2019-01-01 21:05:04,892 INFO L444 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (<= ULTIMATE.start_main_~n~0 2147483647) (<= 0 ULTIMATE.start_main_~n~0)) [2019-01-01 21:05:04,892 INFO L448 ceAbstractionStarter]: For program point L42-1(line 42) no Hoare annotation was computed. [2019-01-01 21:05:04,892 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 41) no Hoare annotation was computed. [2019-01-01 21:05:04,892 INFO L444 ceAbstractionStarter]: At program point L37(lines 37 49) the Hoare annotation is: (<= ULTIMATE.start_main_~n~0 2147483647) [2019-01-01 21:05:04,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 09:05:04 BoogieIcfgContainer [2019-01-01 21:05:04,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 21:05:04,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:05:04,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:05:04,906 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:05:04,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:04:56" (3/4) ... [2019-01-01 21:05:04,911 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 21:05:04,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isEven [2019-01-01 21:05:04,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isOdd [2019-01-01 21:05:04,922 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 21:05:04,922 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 21:05:04,978 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:05:04,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:05:04,979 INFO L168 Benchmark]: Toolchain (without parser) took 9137.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 947.3 MB in the beginning and 938.6 MB in the end (delta: 8.7 MB). Peak memory consumption was 201.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:05:04,980 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 21:05:04,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.49 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 21:05:04,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.90 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:05:04,982 INFO L168 Benchmark]: Boogie Preprocessor took 23.81 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:05:04,982 INFO L168 Benchmark]: RCFGBuilder took 621.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:05:04,983 INFO L168 Benchmark]: TraceAbstraction took 8131.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 938.6 MB in the end (delta: 156.5 MB). Peak memory consumption was 229.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:05:04,984 INFO L168 Benchmark]: Witness Printer took 72.40 ms. Allocated memory is still 1.2 GB. Free memory is still 938.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:05:04,988 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 243.49 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 38.90 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.81 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 621.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8131.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 938.6 MB in the end (delta: 156.5 MB). Peak memory consumption was 229.4 MB. Max. memory is 11.5 GB. * Witness Printer took 72.40 ms. Allocated memory is still 1.2 GB. Free memory is still 938.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: 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 - 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: 37]: Loop Invariant Derived loop invariant: n <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 4 error locations. SAFE Result, 8.0s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 119 SDtfs, 283 SDslu, 708 SDs, 0 SdLazy, 1043 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 11 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 22 PreInvPairs, 23 NumberOfFragments, 52 HoareAnnotationTreeSize, 22 FomulaSimplifications, 824 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 666 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 593 NumberOfCodeBlocks, 593 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 100136 SizeOfPredicates, 42 NumberOfNonLiveVariables, 469 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 84/572 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...