./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1b7166d94206693c3f254a3c1de8d5825f8510fb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:50:07,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:50:07,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:50:07,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:50:07,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:50:07,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:50:07,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:50:07,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:50:07,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:50:07,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:50:07,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:50:07,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:50:07,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:50:07,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:50:07,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:50:07,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:50:07,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:50:07,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:50:07,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:50:07,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:50:07,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:50:07,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:50:07,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:50:07,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:50:07,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:50:07,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:50:07,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:50:07,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:50:07,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:50:07,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:50:07,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:50:07,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:50:07,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:50:07,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:50:07,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:50:07,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:50:07,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:50:07,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:50:07,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:50:07,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:50:07,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:50:07,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 02:50:07,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:50:07,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:50:07,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:50:07,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:50:07,267 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:50:07,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:50:07,270 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:50:07,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:50:07,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:50:07,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:50:07,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:50:07,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:50:07,271 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:50:07,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:50:07,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:50:07,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:50:07,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:50:07,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:50:07,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:50:07,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:50:07,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:50:07,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:50:07,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:50:07,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:50:07,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:50:07,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:50:07,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:50:07,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b7166d94206693c3f254a3c1de8d5825f8510fb [2019-11-28 02:50:07,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:50:07,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:50:07,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:50:07,586 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:50:07,586 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:50:07,587 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c [2019-11-28 02:50:07,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cfc5c7d3/28ecc5ebf2ec42419a49988fe03d2622/FLAG6a8d70d44 [2019-11-28 02:50:08,113 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:50:08,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c [2019-11-28 02:50:08,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cfc5c7d3/28ecc5ebf2ec42419a49988fe03d2622/FLAG6a8d70d44 [2019-11-28 02:50:08,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cfc5c7d3/28ecc5ebf2ec42419a49988fe03d2622 [2019-11-28 02:50:08,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:50:08,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:50:08,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:08,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:50:08,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:50:08,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:08" (1/1) ... [2019-11-28 02:50:08,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1144e865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08, skipping insertion in model container [2019-11-28 02:50:08,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:08" (1/1) ... [2019-11-28 02:50:08,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:50:08,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:50:08,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:08,692 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:50:08,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:08,723 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:50:08,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08 WrapperNode [2019-11-28 02:50:08,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:08,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:08,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:50:08,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:50:08,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08" (1/1) ... [2019-11-28 02:50:08,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08" (1/1) ... [2019-11-28 02:50:08,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:08,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:50:08,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:50:08,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:50:08,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08" (1/1) ... [2019-11-28 02:50:08,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08" (1/1) ... [2019-11-28 02:50:08,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08" (1/1) ... [2019-11-28 02:50:08,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08" (1/1) ... [2019-11-28 02:50:08,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08" (1/1) ... [2019-11-28 02:50:08,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08" (1/1) ... [2019-11-28 02:50:08,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08" (1/1) ... [2019-11-28 02:50:08,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:50:08,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:50:08,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:50:08,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:50:08,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08" (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-11-28 02:50:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 02:50:08,900 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 02:50:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:50:08,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:50:09,090 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:50:09,090 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 02:50:09,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:09 BoogieIcfgContainer [2019-11-28 02:50:09,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:50:09,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:50:09,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:50:09,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:50:09,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:50:08" (1/3) ... [2019-11-28 02:50:09,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16247d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:09, skipping insertion in model container [2019-11-28 02:50:09,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:08" (2/3) ... [2019-11-28 02:50:09,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16247d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:09, skipping insertion in model container [2019-11-28 02:50:09,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:09" (3/3) ... [2019-11-28 02:50:09,102 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2b.c [2019-11-28 02:50:09,115 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:50:09,125 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-28 02:50:09,161 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-28 02:50:09,186 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:50:09,187 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:50:09,187 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:50:09,187 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:50:09,188 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:50:09,188 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:50:09,188 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:50:09,188 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:50:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-28 02:50:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:50:09,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:09,216 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:50:09,216 INFO L410 AbstractCegarLoop]: === Iteration 1 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:09,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1454635077, now seen corresponding path program 1 times [2019-11-28 02:50:09,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:09,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190501370] [2019-11-28 02:50:09,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:09,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190501370] [2019-11-28 02:50:09,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:09,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:09,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779945237] [2019-11-28 02:50:09,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:09,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:09,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:09,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:09,436 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-11-28 02:50:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:09,579 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-11-28 02:50:09,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:09,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-28 02:50:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:09,591 INFO L225 Difference]: With dead ends: 41 [2019-11-28 02:50:09,591 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 02:50:09,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:09,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 02:50:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-11-28 02:50:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 02:50:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-28 02:50:09,641 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 6 [2019-11-28 02:50:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:09,641 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-28 02:50:09,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-11-28 02:50:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:50:09,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:09,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:09,643 INFO L410 AbstractCegarLoop]: === Iteration 2 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2144014465, now seen corresponding path program 1 times [2019-11-28 02:50:09,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:09,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165080875] [2019-11-28 02:50:09,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:09,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165080875] [2019-11-28 02:50:09,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:09,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:50:09,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426992526] [2019-11-28 02:50:09,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:09,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:09,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:09,695 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2019-11-28 02:50:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:09,775 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-11-28 02:50:09,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:09,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-11-28 02:50:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:09,779 INFO L225 Difference]: With dead ends: 50 [2019-11-28 02:50:09,779 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 02:50:09,780 INFO L630 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-11-28 02:50:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 02:50:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2019-11-28 02:50:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:50:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-11-28 02:50:09,794 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 7 [2019-11-28 02:50:09,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:09,795 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-28 02:50:09,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-11-28 02:50:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:50:09,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:09,797 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:09,797 INFO L410 AbstractCegarLoop]: === Iteration 3 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:09,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:09,798 INFO L82 PathProgramCache]: Analyzing trace with hash -736378463, now seen corresponding path program 1 times [2019-11-28 02:50:09,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:09,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836323186] [2019-11-28 02:50:09,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:09,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836323186] [2019-11-28 02:50:09,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188232511] [2019-11-28 02:50:09,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:09,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:09,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:09,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 02:50:09,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697130337] [2019-11-28 02:50:09,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:09,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:09,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:09,989 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 7 states. [2019-11-28 02:50:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:10,167 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2019-11-28 02:50:10,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:10,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-28 02:50:10,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:10,170 INFO L225 Difference]: With dead ends: 63 [2019-11-28 02:50:10,171 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 02:50:10,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 02:50:10,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-11-28 02:50:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 02:50:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2019-11-28 02:50:10,192 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 12 [2019-11-28 02:50:10,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:10,193 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2019-11-28 02:50:10,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2019-11-28 02:50:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 02:50:10,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:10,194 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:10,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:10,408 INFO L410 AbstractCegarLoop]: === Iteration 4 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1009328462, now seen corresponding path program 1 times [2019-11-28 02:50:10,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:10,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756743277] [2019-11-28 02:50:10,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:10,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756743277] [2019-11-28 02:50:10,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:10,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:10,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870540628] [2019-11-28 02:50:10,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:10,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:10,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:10,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:10,492 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 4 states. [2019-11-28 02:50:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:10,534 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2019-11-28 02:50:10,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:10,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 02:50:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:10,539 INFO L225 Difference]: With dead ends: 78 [2019-11-28 02:50:10,539 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 02:50:10,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 02:50:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2019-11-28 02:50:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 02:50:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-11-28 02:50:10,578 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 14 [2019-11-28 02:50:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:10,579 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-11-28 02:50:10,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:10,579 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-11-28 02:50:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:50:10,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:10,580 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:10,581 INFO L410 AbstractCegarLoop]: === Iteration 5 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1224411294, now seen corresponding path program 1 times [2019-11-28 02:50:10,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:10,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54629909] [2019-11-28 02:50:10,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:10,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54629909] [2019-11-28 02:50:10,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:10,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:10,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265167972] [2019-11-28 02:50:10,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:10,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:10,628 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-11-28 02:50:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:10,647 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2019-11-28 02:50:10,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:10,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 02:50:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:10,649 INFO L225 Difference]: With dead ends: 66 [2019-11-28 02:50:10,649 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 02:50:10,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 02:50:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 02:50:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 02:50:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2019-11-28 02:50:10,674 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 15 [2019-11-28 02:50:10,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:10,675 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2019-11-28 02:50:10,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2019-11-28 02:50:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:50:10,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:10,676 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-11-28 02:50:10,676 INFO L410 AbstractCegarLoop]: === Iteration 6 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash -231947135, now seen corresponding path program 2 times [2019-11-28 02:50:10,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:10,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398156276] [2019-11-28 02:50:10,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:10,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398156276] [2019-11-28 02:50:10,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770089100] [2019-11-28 02:50:10,794 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 02:50:10,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:10,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:10,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:50:10,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:10,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:10,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-28 02:50:10,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315096646] [2019-11-28 02:50:10,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:50:10,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:10,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:50:10,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:50:10,837 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 9 states. [2019-11-28 02:50:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:11,025 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2019-11-28 02:50:11,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:50:11,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 02:50:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:11,027 INFO L225 Difference]: With dead ends: 85 [2019-11-28 02:50:11,028 INFO L226 Difference]: Without dead ends: 84 [2019-11-28 02:50:11,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:50:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-28 02:50:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-11-28 02:50:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 02:50:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2019-11-28 02:50:11,043 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 17 [2019-11-28 02:50:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:11,043 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-11-28 02:50:11,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:50:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2019-11-28 02:50:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:50:11,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:11,045 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:11,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:11,249 INFO L410 AbstractCegarLoop]: === Iteration 7 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:11,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash -855233152, now seen corresponding path program 1 times [2019-11-28 02:50:11,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:11,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302563508] [2019-11-28 02:50:11,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:11,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302563508] [2019-11-28 02:50:11,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:11,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:11,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888717409] [2019-11-28 02:50:11,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:11,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:11,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:11,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:11,312 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 6 states. [2019-11-28 02:50:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:11,487 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2019-11-28 02:50:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:11,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-28 02:50:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:11,492 INFO L225 Difference]: With dead ends: 117 [2019-11-28 02:50:11,493 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 02:50:11,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 02:50:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-28 02:50:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 02:50:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-11-28 02:50:11,538 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 19 [2019-11-28 02:50:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:11,538 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-11-28 02:50:11,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2019-11-28 02:50:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:50:11,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:11,542 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:11,542 INFO L410 AbstractCegarLoop]: === Iteration 8 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:11,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:11,543 INFO L82 PathProgramCache]: Analyzing trace with hash -742423898, now seen corresponding path program 1 times [2019-11-28 02:50:11,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:11,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852065921] [2019-11-28 02:50:11,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:11,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852065921] [2019-11-28 02:50:11,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:11,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:11,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758052636] [2019-11-28 02:50:11,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:11,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:11,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:11,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:11,646 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 6 states. [2019-11-28 02:50:11,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:11,730 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2019-11-28 02:50:11,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:11,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 02:50:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:11,732 INFO L225 Difference]: With dead ends: 130 [2019-11-28 02:50:11,732 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 02:50:11,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:50:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 02:50:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 35. [2019-11-28 02:50:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 02:50:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-28 02:50:11,745 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 20 [2019-11-28 02:50:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:11,746 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-28 02:50:11,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-28 02:50:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:50:11,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:11,747 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-11-28 02:50:11,747 INFO L410 AbstractCegarLoop]: === Iteration 9 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:11,751 INFO L82 PathProgramCache]: Analyzing trace with hash -559247967, now seen corresponding path program 3 times [2019-11-28 02:50:11,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:11,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073931714] [2019-11-28 02:50:11,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:11,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073931714] [2019-11-28 02:50:11,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349124089] [2019-11-28 02:50:11,853 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:11,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 02:50:11,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:11,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:50:11,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:11,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:11,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-28 02:50:11,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099862340] [2019-11-28 02:50:11,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:50:11,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:11,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:50:11,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:50:11,911 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2019-11-28 02:50:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:12,146 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-28 02:50:12,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 02:50:12,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-11-28 02:50:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:12,149 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:50:12,149 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 02:50:12,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:50:12,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 02:50:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2019-11-28 02:50:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 02:50:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-28 02:50:12,160 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 22 [2019-11-28 02:50:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:12,166 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-28 02:50:12,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:50:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-28 02:50:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:50:12,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:12,167 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:12,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:12,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:12,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1606295908, now seen corresponding path program 2 times [2019-11-28 02:50:12,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:12,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182923333] [2019-11-28 02:50:12,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:12,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182923333] [2019-11-28 02:50:12,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398421813] [2019-11-28 02:50:12,465 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:12,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:12,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:12,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:50:12,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:12,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:12,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-28 02:50:12,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628326312] [2019-11-28 02:50:12,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:50:12,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:12,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:50:12,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:50:12,518 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2019-11-28 02:50:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:12,633 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-28 02:50:12,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:12,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-28 02:50:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:12,635 INFO L225 Difference]: With dead ends: 70 [2019-11-28 02:50:12,635 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:50:12,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:50:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:50:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-11-28 02:50:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 02:50:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-28 02:50:12,642 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 25 [2019-11-28 02:50:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:12,643 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-28 02:50:12,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:50:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-28 02:50:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:50:12,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:12,644 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-11-28 02:50:12,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:12,848 INFO L410 AbstractCegarLoop]: === Iteration 11 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:12,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1828550785, now seen corresponding path program 4 times [2019-11-28 02:50:12,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:12,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845008151] [2019-11-28 02:50:12,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:12,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845008151] [2019-11-28 02:50:12,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347355147] [2019-11-28 02:50:12,976 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:13,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:50:13,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:13,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:50:13,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 02:50:13,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:13,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-11-28 02:50:13,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339668978] [2019-11-28 02:50:13,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:50:13,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:13,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:50:13,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:50:13,098 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 14 states. [2019-11-28 02:50:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:13,205 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-11-28 02:50:13,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:13,205 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-11-28 02:50:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:13,206 INFO L225 Difference]: With dead ends: 61 [2019-11-28 02:50:13,206 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 02:50:13,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:50:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 02:50:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 33. [2019-11-28 02:50:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 02:50:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-28 02:50:13,217 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 27 [2019-11-28 02:50:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:13,217 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-28 02:50:13,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:50:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-28 02:50:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:50:13,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:13,223 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:13,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:13,433 INFO L410 AbstractCegarLoop]: === Iteration 12 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:13,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:13,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1103662182, now seen corresponding path program 3 times [2019-11-28 02:50:13,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:13,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015999164] [2019-11-28 02:50:13,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:13,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015999164] [2019-11-28 02:50:13,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561895016] [2019-11-28 02:50:13,544 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:13,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 02:50:13,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:13,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:50:13,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:13,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:13,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-28 02:50:13,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730214271] [2019-11-28 02:50:13,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:50:13,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:13,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:50:13,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:13,584 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 10 states. [2019-11-28 02:50:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:13,756 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-28 02:50:13,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 02:50:13,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-11-28 02:50:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:13,761 INFO L225 Difference]: With dead ends: 42 [2019-11-28 02:50:13,761 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:50:13,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:50:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:50:13,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:50:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:50:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:50:13,763 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-11-28 02:50:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:13,763 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:50:13,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:50:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:50:13,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:50:13,969 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:13,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:50:14,531 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 25 [2019-11-28 02:50:14,657 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 22 [2019-11-28 02:50:14,660 INFO L246 CegarLoopResult]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. [2019-11-28 02:50:14,660 INFO L246 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2019-11-28 02:50:14,660 INFO L246 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-11-28 02:50:14,661 INFO L242 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (or (<= 2 g_~x) (not (<= 2 |g_#in~x|)) (not (<= |g_#in~x| 2))) (or (and (<= 0 g_~x) (<= g_~x 2147483647) (not (= 0 g_~x))) (not (<= 0 |g_#in~x|)) (not (<= |g_#in~x| 2147483647)))) [2019-11-28 02:50:14,661 INFO L246 CegarLoopResult]: For program point L12(lines 12 15) no Hoare annotation was computed. [2019-11-28 02:50:14,661 INFO L246 CegarLoopResult]: For program point L15-3(line 15) no Hoare annotation was computed. [2019-11-28 02:50:14,661 INFO L246 CegarLoopResult]: For program point L15-4(line 15) no Hoare annotation was computed. [2019-11-28 02:50:14,661 INFO L246 CegarLoopResult]: For program point L15-5(line 15) no Hoare annotation was computed. [2019-11-28 02:50:14,661 INFO L246 CegarLoopResult]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 02:50:14,662 INFO L242 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (let ((.cse0 (not (<= 0 |g_#in~x|))) (.cse1 (not (<= |g_#in~x| 2147483647)))) (and (or (not (<= 2 |g_#in~x|)) (not (<= |g_#in~x| 2))) (or (<= 1 g_~x) .cse0 .cse1) (or .cse0 (and (<= g_~x 2147483647) (<= |g_#t~ret0| 1) (<= 1 |g_#t~ret0|)) .cse1))) [2019-11-28 02:50:14,662 INFO L246 CegarLoopResult]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. [2019-11-28 02:50:14,662 INFO L246 CegarLoopResult]: For program point L15-7(line 15) no Hoare annotation was computed. [2019-11-28 02:50:14,662 INFO L249 CegarLoopResult]: At program point gENTRY(lines 10 16) the Hoare annotation is: true [2019-11-28 02:50:14,662 INFO L246 CegarLoopResult]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 02:50:14,663 INFO L246 CegarLoopResult]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 02:50:14,663 INFO L246 CegarLoopResult]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 02:50:14,663 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:50:14,663 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:50:14,663 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:50:14,664 INFO L242 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0)) [2019-11-28 02:50:14,664 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-28 02:50:14,664 INFO L246 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-11-28 02:50:14,664 INFO L242 CegarLoopResult]: At program point L18(lines 18 22) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-28 02:50:14,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:50:14 BoogieIcfgContainer [2019-11-28 02:50:14,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:50:14,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:50:14,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:50:14,688 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:50:14,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:09" (3/4) ... [2019-11-28 02:50:14,692 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:50:14,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-28 02:50:14,706 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:50:14,706 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:50:14,762 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:50:14,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:50:14,764 INFO L168 Benchmark]: Toolchain (without parser) took 6282.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -66.4 MB). Peak memory consumption was 132.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:14,765 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:14,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.77 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:14,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.13 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:14,766 INFO L168 Benchmark]: Boogie Preprocessor took 80.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:14,767 INFO L168 Benchmark]: RCFGBuilder took 250.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:14,768 INFO L168 Benchmark]: TraceAbstraction took 5593.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.2 MB). Peak memory consumption was 150.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:14,768 INFO L168 Benchmark]: Witness Printer took 74.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:14,771 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 241.77 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 36.13 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 250.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5593.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.2 MB). Peak memory consumption was 150.3 MB. Max. memory is 11.5 GB. * Witness Printer took 74.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: x <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 4 error locations. Result: SAFE, OverallTime: 4.7s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 201 SDtfs, 335 SDslu, 659 SDs, 0 SdLazy, 621 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 146 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 126 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 62 PreInvPairs, 67 NumberOfFragments, 85 HoareAnnotationTreeSize, 62 FomulaSimplifications, 18966 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 4821 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 329 ConstructedInterpolants, 0 QuantifiedInterpolants, 21879 SizeOfPredicates, 19 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 131/307 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...