./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 678e0110 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_2c.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 14df269faa4a77275028af94d8141ab36c184cf5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:17:58,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:17:58,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:17:58,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:17:58,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:17:58,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:17:58,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:17:58,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:17:58,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:17:58,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:17:58,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:17:58,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:17:58,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:17:58,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:17:58,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:17:58,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:17:58,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:17:58,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:17:58,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:17:58,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:17:58,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:17:58,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:17:58,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:17:58,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:17:58,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:17:58,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:17:58,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:17:58,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:17:58,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:17:58,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:17:58,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:17:58,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:17:58,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:17:58,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:17:58,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:17:58,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:17:58,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:17:58,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:17:58,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:17:58,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:17:58,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:17:58,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-19 22:17:58,160 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:17:58,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:17:58,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:17:58,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:17:58,163 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:17:58,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:17:58,163 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:17:58,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:17:58,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:17:58,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:17:58,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:17:58,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:17:58,166 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-19 22:17:58,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:17:58,166 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:17:58,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:17:58,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:17:58,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:17:58,168 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:17:58,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:17:58,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:17:58,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:17:58,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:17:58,169 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:17:58,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:17:58,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:17:58,170 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:17:58,170 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 -> 14df269faa4a77275028af94d8141ab36c184cf5 [2019-11-19 22:17:58,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:17:58,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:17:58,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:17:58,505 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:17:58,506 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:17:58,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2019-11-19 22:17:58,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263f2e737/411eea91b64b4db484cf78c512dd2e28/FLAG1799db3b4 [2019-11-19 22:17:59,004 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:17:59,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2019-11-19 22:17:59,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263f2e737/411eea91b64b4db484cf78c512dd2e28/FLAG1799db3b4 [2019-11-19 22:17:59,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263f2e737/411eea91b64b4db484cf78c512dd2e28 [2019-11-19 22:17:59,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:17:59,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:17:59,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:17:59,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:17:59,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:17:59,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564d953c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59, skipping insertion in model container [2019-11-19 22:17:59,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,433 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:17:59,451 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:17:59,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:17:59,656 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:17:59,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:17:59,694 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:17:59,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59 WrapperNode [2019-11-19 22:17:59,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:17:59,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:17:59,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:17:59,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:17:59,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:17:59,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:17:59,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:17:59,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:17:59,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (1/1) ... [2019-11-19 22:17:59,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:17:59,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:17:59,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:17:59,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:17:59,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (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-19 22:17:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-19 22:17:59,921 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-19 22:17:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:17:59,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:18:00,115 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:18:00,115 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 22:18:00,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:00 BoogieIcfgContainer [2019-11-19 22:18:00,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:18:00,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:18:00,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:18:00,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:18:00,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:17:59" (1/3) ... [2019-11-19 22:18:00,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@899d4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:00, skipping insertion in model container [2019-11-19 22:18:00,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:59" (2/3) ... [2019-11-19 22:18:00,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@899d4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:00, skipping insertion in model container [2019-11-19 22:18:00,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:00" (3/3) ... [2019-11-19 22:18:00,126 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2c.c [2019-11-19 22:18:00,136 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:18:00,144 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-19 22:18:00,157 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-19 22:18:00,207 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:18:00,210 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:18:00,210 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:18:00,210 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:18:00,210 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:18:00,210 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:18:00,211 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:18:00,211 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:18:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-19 22:18:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-19 22:18:00,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:00,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:18:00,248 INFO L410 AbstractCegarLoop]: === Iteration 1 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1454635077, now seen corresponding path program 1 times [2019-11-19 22:18:00,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:00,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137887102] [2019-11-19 22:18:00,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:00,465 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-19 22:18:00,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137887102] [2019-11-19 22:18:00,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:00,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:18:00,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061517762] [2019-11-19 22:18:00,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:18:00,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:00,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:18:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:18:00,494 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-11-19 22:18:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:00,634 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-11-19 22:18:00,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:18:00,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-19 22:18:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:00,646 INFO L225 Difference]: With dead ends: 41 [2019-11-19 22:18:00,647 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 22:18:00,650 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-19 22:18:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 22:18:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-11-19 22:18:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 22:18:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-19 22:18:00,697 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 6 [2019-11-19 22:18:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:00,697 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-19 22:18:00,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:18:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-11-19 22:18:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-19 22:18:00,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:00,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:00,699 INFO L410 AbstractCegarLoop]: === Iteration 2 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:00,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:00,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2144014465, now seen corresponding path program 1 times [2019-11-19 22:18:00,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:00,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773450572] [2019-11-19 22:18:00,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:00,747 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-19 22:18:00,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773450572] [2019-11-19 22:18:00,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:00,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:18:00,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096333888] [2019-11-19 22:18:00,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:18:00,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:00,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:18:00,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:18:00,751 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2019-11-19 22:18:00,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:00,859 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-11-19 22:18:00,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:18:00,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-11-19 22:18:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:00,864 INFO L225 Difference]: With dead ends: 50 [2019-11-19 22:18:00,865 INFO L226 Difference]: Without dead ends: 46 [2019-11-19 22:18:00,866 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-19 22:18:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-19 22:18:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2019-11-19 22:18:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-19 22:18:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-11-19 22:18:00,895 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 7 [2019-11-19 22:18:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:00,896 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-19 22:18:00,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:18:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-11-19 22:18:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 22:18:00,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:00,898 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:00,899 INFO L410 AbstractCegarLoop]: === Iteration 3 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:00,899 INFO L82 PathProgramCache]: Analyzing trace with hash -736378463, now seen corresponding path program 1 times [2019-11-19 22:18:00,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:00,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8732605] [2019-11-19 22:18:00,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:00,984 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-19 22:18:00,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8732605] [2019-11-19 22:18:00,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028113264] [2019-11-19 22:18:00,987 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-19 22:18:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:18:01,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:01,051 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-19 22:18:01,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:01,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-19 22:18:01,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587955509] [2019-11-19 22:18:01,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:18:01,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:01,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:18:01,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:18:01,054 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 7 states. [2019-11-19 22:18:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:01,196 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2019-11-19 22:18:01,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:18:01,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-19 22:18:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:01,201 INFO L225 Difference]: With dead ends: 63 [2019-11-19 22:18:01,201 INFO L226 Difference]: Without dead ends: 62 [2019-11-19 22:18:01,202 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-19 22:18:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-19 22:18:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-11-19 22:18:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-19 22:18:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2019-11-19 22:18:01,234 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 12 [2019-11-19 22:18:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:01,235 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2019-11-19 22:18:01,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:18:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2019-11-19 22:18:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 22:18:01,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:01,237 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:01,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:01,443 INFO L410 AbstractCegarLoop]: === Iteration 4 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:01,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:01,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1009328462, now seen corresponding path program 1 times [2019-11-19 22:18:01,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:01,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71171437] [2019-11-19 22:18:01,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,495 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-19 22:18:01,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71171437] [2019-11-19 22:18:01,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:01,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:18:01,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004240926] [2019-11-19 22:18:01,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:01,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:01,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:01,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:01,499 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 3 states. [2019-11-19 22:18:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:01,534 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2019-11-19 22:18:01,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:01,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-19 22:18:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:01,536 INFO L225 Difference]: With dead ends: 52 [2019-11-19 22:18:01,536 INFO L226 Difference]: Without dead ends: 51 [2019-11-19 22:18:01,537 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-19 22:18:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-19 22:18:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-19 22:18:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-19 22:18:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-11-19 22:18:01,550 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 14 [2019-11-19 22:18:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:01,550 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-11-19 22:18:01,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2019-11-19 22:18:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:18:01,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:01,552 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:01,552 INFO L410 AbstractCegarLoop]: === Iteration 5 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1224411294, now seen corresponding path program 1 times [2019-11-19 22:18:01,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:01,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277479652] [2019-11-19 22:18:01,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,602 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-19 22:18:01,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277479652] [2019-11-19 22:18:01,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:01,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:18:01,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169935605] [2019-11-19 22:18:01,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:18:01,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:01,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:18:01,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:18:01,605 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 4 states. [2019-11-19 22:18:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:01,631 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2019-11-19 22:18:01,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:18:01,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-19 22:18:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:01,633 INFO L225 Difference]: With dead ends: 77 [2019-11-19 22:18:01,633 INFO L226 Difference]: Without dead ends: 76 [2019-11-19 22:18:01,634 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-19 22:18:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-19 22:18:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-11-19 22:18:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-19 22:18:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-11-19 22:18:01,649 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 15 [2019-11-19 22:18:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:01,650 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-11-19 22:18:01,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:18:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-11-19 22:18:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 22:18:01,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:01,652 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-11-19 22:18:01,652 INFO L410 AbstractCegarLoop]: === Iteration 6 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:01,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:01,653 INFO L82 PathProgramCache]: Analyzing trace with hash -231947135, now seen corresponding path program 2 times [2019-11-19 22:18:01,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:01,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444946371] [2019-11-19 22:18:01,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:01,752 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-19 22:18:01,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444946371] [2019-11-19 22:18:01,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873828083] [2019-11-19 22:18:01,753 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-19 22:18:01,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:01,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:01,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:18:01,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:01,799 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-19 22:18:01,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:01,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-19 22:18:01,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761101798] [2019-11-19 22:18:01,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:18:01,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:01,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:18:01,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:18:01,808 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 9 states. [2019-11-19 22:18:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:01,999 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2019-11-19 22:18:02,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:18:02,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-19 22:18:02,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:02,002 INFO L225 Difference]: With dead ends: 90 [2019-11-19 22:18:02,002 INFO L226 Difference]: Without dead ends: 89 [2019-11-19 22:18:02,003 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-19 22:18:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-19 22:18:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-11-19 22:18:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-19 22:18:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-11-19 22:18:02,019 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 17 [2019-11-19 22:18:02,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:02,020 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-11-19 22:18:02,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:18:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-11-19 22:18:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:18:02,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:02,022 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:02,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:02,226 INFO L410 AbstractCegarLoop]: === Iteration 7 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:02,227 INFO L82 PathProgramCache]: Analyzing trace with hash -855233152, now seen corresponding path program 1 times [2019-11-19 22:18:02,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:02,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838923835] [2019-11-19 22:18:02,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,305 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-19 22:18:02,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838923835] [2019-11-19 22:18:02,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:02,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:18:02,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602067874] [2019-11-19 22:18:02,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:18:02,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:02,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:18:02,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:18:02,307 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 6 states. [2019-11-19 22:18:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:02,458 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2019-11-19 22:18:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:18:02,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-19 22:18:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:02,460 INFO L225 Difference]: With dead ends: 117 [2019-11-19 22:18:02,461 INFO L226 Difference]: Without dead ends: 116 [2019-11-19 22:18:02,462 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-19 22:18:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-19 22:18:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-19 22:18:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-19 22:18:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-11-19 22:18:02,485 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 19 [2019-11-19 22:18:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:02,485 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-11-19 22:18:02,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:18:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2019-11-19 22:18:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:18:02,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:02,487 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:02,487 INFO L410 AbstractCegarLoop]: === Iteration 8 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:02,488 INFO L82 PathProgramCache]: Analyzing trace with hash -742423898, now seen corresponding path program 1 times [2019-11-19 22:18:02,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:02,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993596502] [2019-11-19 22:18:02,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,546 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-19 22:18:02,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993596502] [2019-11-19 22:18:02,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:02,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:18:02,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8409052] [2019-11-19 22:18:02,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:18:02,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:02,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:18:02,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:18:02,549 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 6 states. [2019-11-19 22:18:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:02,697 INFO L93 Difference]: Finished difference Result 135 states and 174 transitions. [2019-11-19 22:18:02,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:18:02,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-19 22:18:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:02,700 INFO L225 Difference]: With dead ends: 135 [2019-11-19 22:18:02,700 INFO L226 Difference]: Without dead ends: 134 [2019-11-19 22:18:02,702 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-19 22:18:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-19 22:18:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2019-11-19 22:18:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-19 22:18:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2019-11-19 22:18:02,738 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 20 [2019-11-19 22:18:02,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:02,738 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2019-11-19 22:18:02,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:18:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2019-11-19 22:18:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:18:02,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:02,741 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-11-19 22:18:02,742 INFO L410 AbstractCegarLoop]: === Iteration 9 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:02,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:02,743 INFO L82 PathProgramCache]: Analyzing trace with hash -559247967, now seen corresponding path program 3 times [2019-11-19 22:18:02,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:02,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501216584] [2019-11-19 22:18:02,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:02,891 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-19 22:18:02,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501216584] [2019-11-19 22:18:02,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842313662] [2019-11-19 22:18:02,892 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-19 22:18:02,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 22:18:02,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:02,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:18:02,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:02,959 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-19 22:18:02,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:02,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-19 22:18:02,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405175847] [2019-11-19 22:18:02,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:18:02,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:02,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:18:02,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:18:02,962 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand 11 states. [2019-11-19 22:18:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:03,228 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2019-11-19 22:18:03,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 22:18:03,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-11-19 22:18:03,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:03,234 INFO L225 Difference]: With dead ends: 150 [2019-11-19 22:18:03,234 INFO L226 Difference]: Without dead ends: 149 [2019-11-19 22:18:03,235 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-19 22:18:03,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-19 22:18:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2019-11-19 22:18:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-19 22:18:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2019-11-19 22:18:03,259 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 22 [2019-11-19 22:18:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:03,260 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2019-11-19 22:18:03,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:18:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2019-11-19 22:18:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:18:03,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:03,262 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:03,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:03,474 INFO L410 AbstractCegarLoop]: === Iteration 10 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:03,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:03,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1606295908, now seen corresponding path program 2 times [2019-11-19 22:18:03,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:03,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069974574] [2019-11-19 22:18:03,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:03,581 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-19 22:18:03,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069974574] [2019-11-19 22:18:03,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799940547] [2019-11-19 22:18:03,582 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-19 22:18:03,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:03,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:03,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:18:03,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:03,621 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-19 22:18:03,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:03,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-19 22:18:03,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961678537] [2019-11-19 22:18:03,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:18:03,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:18:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:18:03,624 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand 8 states. [2019-11-19 22:18:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:03,847 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2019-11-19 22:18:03,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 22:18:03,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-19 22:18:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:03,850 INFO L225 Difference]: With dead ends: 174 [2019-11-19 22:18:03,850 INFO L226 Difference]: Without dead ends: 173 [2019-11-19 22:18:03,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:18:03,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-19 22:18:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2019-11-19 22:18:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-19 22:18:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 206 transitions. [2019-11-19 22:18:03,868 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 206 transitions. Word has length 25 [2019-11-19 22:18:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:03,868 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 206 transitions. [2019-11-19 22:18:03,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:18:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 206 transitions. [2019-11-19 22:18:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:18:03,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:03,870 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-11-19 22:18:04,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:04,074 INFO L410 AbstractCegarLoop]: === Iteration 11 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:04,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1828550785, now seen corresponding path program 4 times [2019-11-19 22:18:04,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:04,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387173933] [2019-11-19 22:18:04,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,208 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-19 22:18:04,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387173933] [2019-11-19 22:18:04,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476897638] [2019-11-19 22:18:04,209 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-19 22:18:04,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:18:04,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:04,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 22:18:04,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:04,312 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-19 22:18:04,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:04,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-11-19 22:18:04,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926203790] [2019-11-19 22:18:04,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 22:18:04,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:04,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:18:04,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:18:04,314 INFO L87 Difference]: Start difference. First operand 161 states and 206 transitions. Second operand 14 states. [2019-11-19 22:18:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:04,411 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. [2019-11-19 22:18:04,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:18:04,413 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-11-19 22:18:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:04,415 INFO L225 Difference]: With dead ends: 165 [2019-11-19 22:18:04,415 INFO L226 Difference]: Without dead ends: 164 [2019-11-19 22:18:04,416 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-19 22:18:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-19 22:18:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-11-19 22:18:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-19 22:18:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 205 transitions. [2019-11-19 22:18:04,431 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 205 transitions. Word has length 27 [2019-11-19 22:18:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:04,431 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 205 transitions. [2019-11-19 22:18:04,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 22:18:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 205 transitions. [2019-11-19 22:18:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 22:18:04,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:04,433 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:04,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:04,638 INFO L410 AbstractCegarLoop]: === Iteration 12 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:04,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1103662182, now seen corresponding path program 3 times [2019-11-19 22:18:04,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:04,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289403812] [2019-11-19 22:18:04,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:04,715 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-19 22:18:04,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289403812] [2019-11-19 22:18:04,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736171887] [2019-11-19 22:18:04,715 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-19 22:18:04,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-19 22:18:04,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:04,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:18:04,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:04,758 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-19 22:18:04,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:04,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-19 22:18:04,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328500669] [2019-11-19 22:18:04,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:18:04,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:04,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:18:04,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:18:04,761 INFO L87 Difference]: Start difference. First operand 161 states and 205 transitions. Second operand 10 states. [2019-11-19 22:18:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:05,078 INFO L93 Difference]: Finished difference Result 194 states and 248 transitions. [2019-11-19 22:18:05,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 22:18:05,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-11-19 22:18:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:05,081 INFO L225 Difference]: With dead ends: 194 [2019-11-19 22:18:05,081 INFO L226 Difference]: Without dead ends: 193 [2019-11-19 22:18:05,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-19 22:18:05,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-19 22:18:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-11-19 22:18:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-19 22:18:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 228 transitions. [2019-11-19 22:18:05,098 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 228 transitions. Word has length 30 [2019-11-19 22:18:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:05,098 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 228 transitions. [2019-11-19 22:18:05,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:18:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 228 transitions. [2019-11-19 22:18:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 22:18:05,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:05,101 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:05,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:05,304 INFO L410 AbstractCegarLoop]: === Iteration 13 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:05,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1629013057, now seen corresponding path program 1 times [2019-11-19 22:18:05,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:05,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923724353] [2019-11-19 22:18:05,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 22:18:05,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923724353] [2019-11-19 22:18:05,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:05,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:18:05,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317301229] [2019-11-19 22:18:05,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:18:05,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:05,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:18:05,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:18:05,379 INFO L87 Difference]: Start difference. First operand 179 states and 228 transitions. Second operand 5 states. [2019-11-19 22:18:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:05,400 INFO L93 Difference]: Finished difference Result 179 states and 228 transitions. [2019-11-19 22:18:05,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:18:05,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 22:18:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:05,403 INFO L225 Difference]: With dead ends: 179 [2019-11-19 22:18:05,403 INFO L226 Difference]: Without dead ends: 178 [2019-11-19 22:18:05,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-19 22:18:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-19 22:18:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-11-19 22:18:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-19 22:18:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 218 transitions. [2019-11-19 22:18:05,416 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 218 transitions. Word has length 31 [2019-11-19 22:18:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:05,417 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 218 transitions. [2019-11-19 22:18:05,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:18:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 218 transitions. [2019-11-19 22:18:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 22:18:05,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:05,419 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:05,419 INFO L410 AbstractCegarLoop]: === Iteration 14 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash 857271516, now seen corresponding path program 4 times [2019-11-19 22:18:05,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:05,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559056360] [2019-11-19 22:18:05,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:18:05,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559056360] [2019-11-19 22:18:05,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597675912] [2019-11-19 22:18:05,519 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-19 22:18:05,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:18:05,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:05,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:18:05,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-19 22:18:05,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:18:05,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2019-11-19 22:18:05,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121138353] [2019-11-19 22:18:05,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:18:05,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:05,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:18:05,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:18:05,596 INFO L87 Difference]: Start difference. First operand 178 states and 218 transitions. Second operand 6 states. [2019-11-19 22:18:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:05,655 INFO L93 Difference]: Finished difference Result 239 states and 303 transitions. [2019-11-19 22:18:05,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:18:05,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-19 22:18:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:05,657 INFO L225 Difference]: With dead ends: 239 [2019-11-19 22:18:05,658 INFO L226 Difference]: Without dead ends: 111 [2019-11-19 22:18:05,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:18:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-19 22:18:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2019-11-19 22:18:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-19 22:18:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2019-11-19 22:18:05,671 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 35 [2019-11-19 22:18:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:05,671 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2019-11-19 22:18:05,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:18:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2019-11-19 22:18:05,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 22:18:05,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:05,673 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:05,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:05,885 INFO L410 AbstractCegarLoop]: === Iteration 15 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:05,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:05,886 INFO L82 PathProgramCache]: Analyzing trace with hash -490250333, now seen corresponding path program 1 times [2019-11-19 22:18:05,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:05,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197585446] [2019-11-19 22:18:05,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 22:18:05,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197585446] [2019-11-19 22:18:05,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:05,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 22:18:05,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707778629] [2019-11-19 22:18:05,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:18:05,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:05,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:18:05,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:18:05,974 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand 7 states. [2019-11-19 22:18:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:06,094 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2019-11-19 22:18:06,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:18:06,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-19 22:18:06,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:06,096 INFO L225 Difference]: With dead ends: 106 [2019-11-19 22:18:06,096 INFO L226 Difference]: Without dead ends: 105 [2019-11-19 22:18:06,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:18:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-19 22:18:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-11-19 22:18:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-19 22:18:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2019-11-19 22:18:06,111 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 35 [2019-11-19 22:18:06,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:06,111 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2019-11-19 22:18:06,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:18:06,112 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2019-11-19 22:18:06,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 22:18:06,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:06,113 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:06,113 INFO L410 AbstractCegarLoop]: === Iteration 16 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:06,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1982108899, now seen corresponding path program 1 times [2019-11-19 22:18:06,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:06,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632708501] [2019-11-19 22:18:06,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 22:18:06,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632708501] [2019-11-19 22:18:06,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:06,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 22:18:06,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260127536] [2019-11-19 22:18:06,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:18:06,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:06,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:18:06,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:18:06,173 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand 7 states. [2019-11-19 22:18:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:06,285 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2019-11-19 22:18:06,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:18:06,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-19 22:18:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:06,288 INFO L225 Difference]: With dead ends: 124 [2019-11-19 22:18:06,288 INFO L226 Difference]: Without dead ends: 123 [2019-11-19 22:18:06,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:18:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-19 22:18:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-19 22:18:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-19 22:18:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-11-19 22:18:06,302 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 36 [2019-11-19 22:18:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:06,303 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-11-19 22:18:06,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:18:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-11-19 22:18:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-19 22:18:06,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:06,308 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:06,308 INFO L410 AbstractCegarLoop]: === Iteration 17 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:06,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:06,309 INFO L82 PathProgramCache]: Analyzing trace with hash -732976513, now seen corresponding path program 2 times [2019-11-19 22:18:06,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:06,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117647882] [2019-11-19 22:18:06,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 22:18:06,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117647882] [2019-11-19 22:18:06,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336389475] [2019-11-19 22:18:06,416 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:06,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:06,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:06,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:18:06,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 22:18:06,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:06,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-19 22:18:06,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712109443] [2019-11-19 22:18:06,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:18:06,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:06,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:18:06,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:18:06,480 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 9 states. [2019-11-19 22:18:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:06,673 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2019-11-19 22:18:06,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 22:18:06,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-11-19 22:18:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:06,675 INFO L225 Difference]: With dead ends: 140 [2019-11-19 22:18:06,675 INFO L226 Difference]: Without dead ends: 139 [2019-11-19 22:18:06,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-11-19 22:18:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-19 22:18:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-11-19 22:18:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-19 22:18:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2019-11-19 22:18:06,685 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 41 [2019-11-19 22:18:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:06,686 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2019-11-19 22:18:06,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:18:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2019-11-19 22:18:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-19 22:18:06,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:06,688 INFO L410 BasicCegarLoop]: trace histogram [7, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:06,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:06,892 INFO L410 AbstractCegarLoop]: === Iteration 18 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:06,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:06,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2029893219, now seen corresponding path program 3 times [2019-11-19 22:18:06,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:06,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787031524] [2019-11-19 22:18:06,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 22:18:07,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787031524] [2019-11-19 22:18:07,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200077827] [2019-11-19 22:18:07,003 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:07,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-19 22:18:07,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:07,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:18:07,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 22:18:07,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:07,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-19 22:18:07,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334221446] [2019-11-19 22:18:07,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:18:07,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:07,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:18:07,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:18:07,067 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand 11 states. [2019-11-19 22:18:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:07,396 INFO L93 Difference]: Finished difference Result 158 states and 183 transitions. [2019-11-19 22:18:07,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-19 22:18:07,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-11-19 22:18:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:07,398 INFO L225 Difference]: With dead ends: 158 [2019-11-19 22:18:07,398 INFO L226 Difference]: Without dead ends: 157 [2019-11-19 22:18:07,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2019-11-19 22:18:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-19 22:18:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-11-19 22:18:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-19 22:18:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-11-19 22:18:07,409 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 46 [2019-11-19 22:18:07,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:07,410 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-11-19 22:18:07,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:18:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-11-19 22:18:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-19 22:18:07,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:07,412 INFO L410 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:07,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:07,623 INFO L410 AbstractCegarLoop]: === Iteration 19 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:07,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:07,624 INFO L82 PathProgramCache]: Analyzing trace with hash -613451521, now seen corresponding path program 4 times [2019-11-19 22:18:07,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:07,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130354762] [2019-11-19 22:18:07,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 22:18:07,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130354762] [2019-11-19 22:18:07,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012370011] [2019-11-19 22:18:07,773 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:07,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:18:07,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:07,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:18:07,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 22:18:07,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:07,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-11-19 22:18:07,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576765614] [2019-11-19 22:18:07,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:18:07,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:07,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:18:07,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:18:07,853 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 13 states. [2019-11-19 22:18:08,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:08,324 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2019-11-19 22:18:08,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-19 22:18:08,324 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-11-19 22:18:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:08,326 INFO L225 Difference]: With dead ends: 176 [2019-11-19 22:18:08,326 INFO L226 Difference]: Without dead ends: 175 [2019-11-19 22:18:08,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2019-11-19 22:18:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-19 22:18:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-11-19 22:18:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-19 22:18:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2019-11-19 22:18:08,337 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 51 [2019-11-19 22:18:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:08,337 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2019-11-19 22:18:08,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:18:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2019-11-19 22:18:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-19 22:18:08,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:08,339 INFO L410 BasicCegarLoop]: trace histogram [9, 7, 7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:08,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:08,542 INFO L410 AbstractCegarLoop]: === Iteration 20 === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:08,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1845164003, now seen corresponding path program 5 times [2019-11-19 22:18:08,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:08,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533313131] [2019-11-19 22:18:08,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 22:18:08,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533313131] [2019-11-19 22:18:08,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664749431] [2019-11-19 22:18:08,664 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:08,696 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-19 22:18:08,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:08,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:18:08,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-19 22:18:08,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:18:08,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2019-11-19 22:18:08,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111406399] [2019-11-19 22:18:08,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:18:08,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:18:08,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-11-19 22:18:08,782 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand 7 states. [2019-11-19 22:18:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:08,853 INFO L93 Difference]: Finished difference Result 215 states and 251 transitions. [2019-11-19 22:18:08,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:18:08,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-19 22:18:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:08,855 INFO L225 Difference]: With dead ends: 215 [2019-11-19 22:18:08,855 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:18:08,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-11-19 22:18:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:18:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:18:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:18:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:18:08,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-11-19 22:18:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:08,858 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:18:08,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:18:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:18:08,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:18:09,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:09,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:18:09,287 INFO L444 ceAbstractionStarter]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. [2019-11-19 22:18:09,287 INFO L444 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-11-19 22:18:09,288 INFO L444 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-11-19 22:18:09,288 INFO L440 ceAbstractionStarter]: At program point L15-2(line 15) the Hoare annotation is: (and (not (= 0 |g_#in~x|)) (or (and (<= 0 g_~x) (<= g_~x 2147483647) (not (= 0 g_~x))) (not (<= 0 |g_#in~x|)) (not (<= |g_#in~x| 2147483647)))) [2019-11-19 22:18:09,288 INFO L444 ceAbstractionStarter]: For program point L12(lines 12 15) no Hoare annotation was computed. [2019-11-19 22:18:09,288 INFO L444 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. [2019-11-19 22:18:09,288 INFO L444 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. [2019-11-19 22:18:09,288 INFO L444 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. [2019-11-19 22:18:09,288 INFO L444 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-19 22:18:09,289 INFO L440 ceAbstractionStarter]: At program point L15-6(line 15) the Hoare annotation is: (and (not (= 0 |g_#in~x|)) (or (not (<= 0 |g_#in~x|)) (and (<= 0 g_~x) (<= g_~x 2147483647) (<= |g_#t~ret0| 1) (<= 1 |g_#t~ret0|) (not (= 0 g_~x))) (not (<= |g_#in~x| 2147483647)))) [2019-11-19 22:18:09,289 INFO L444 ceAbstractionStarter]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. [2019-11-19 22:18:09,289 INFO L444 ceAbstractionStarter]: For program point L15-7(line 15) no Hoare annotation was computed. [2019-11-19 22:18:09,289 INFO L447 ceAbstractionStarter]: At program point gENTRY(lines 10 16) the Hoare annotation is: true [2019-11-19 22:18:09,289 INFO L444 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-19 22:18:09,289 INFO L444 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-19 22:18:09,289 INFO L444 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-19 22:18:09,289 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:18:09,290 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:18:09,290 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:18:09,290 INFO L440 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0)) [2019-11-19 22:18:09,290 INFO L444 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-19 22:18:09,290 INFO L444 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-11-19 22:18:09,290 INFO L440 ceAbstractionStarter]: At program point L18(lines 18 22) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-19 22:18:09,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:18:09 BoogieIcfgContainer [2019-11-19 22:18:09,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:18:09,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:18:09,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:18:09,308 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:18:09,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:00" (3/4) ... [2019-11-19 22:18:09,313 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:18:09,321 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-19 22:18:09,327 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 22:18:09,327 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:18:09,379 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 22:18:09,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:18:09,382 INFO L168 Benchmark]: Toolchain (without parser) took 9965.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 264.8 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -78.2 MB). Peak memory consumption was 186.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:09,382 INFO L168 Benchmark]: CDTParser took 0.29 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-19 22:18:09,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.40 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:09,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -210.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:09,383 INFO L168 Benchmark]: Boogie Preprocessor took 28.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:09,384 INFO L168 Benchmark]: RCFGBuilder took 264.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:09,385 INFO L168 Benchmark]: TraceAbstraction took 9189.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.0 MB). Peak memory consumption was 193.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:09,385 INFO L168 Benchmark]: Witness Printer took 71.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:09,388 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.29 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 279.40 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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 125.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -210.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 264.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9189.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.0 MB). Peak memory consumption was 193.1 MB. Max. memory is 11.5 GB. * Witness Printer took 71.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: x <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 4 error locations. Result: SAFE, OverallTime: 9.0s, OverallIterations: 20, TraceHistogramMax: 9, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 371 SDtfs, 640 SDslu, 1406 SDs, 0 SdLazy, 1497 SolverSat, 344 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 690 GetRequests, 438 SyntacticMatches, 4 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 89 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 170 PreInvPairs, 182 NumberOfFragments, 67 HoareAnnotationTreeSize, 170 FomulaSimplifications, 254 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 410 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 907 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 77162 SizeOfPredicates, 30 NumberOfNonLiveVariables, 656 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 934/1271 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...