./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad4e6ad99a266ddeead98987e8e44db723af5bc7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:25:44,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:25:44,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:25:44,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:25:44,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:25:44,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:25:44,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:25:44,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:25:44,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:25:44,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:25:44,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:25:44,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:25:44,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:25:44,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:25:44,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:25:44,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:25:44,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:25:44,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:25:44,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:25:44,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:25:44,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:25:44,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:25:44,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:25:44,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:25:44,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:25:44,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:25:44,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:25:44,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:25:44,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:25:44,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:25:44,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:25:44,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:25:44,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:25:44,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:25:44,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:25:44,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:25:44,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:25:44,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:25:44,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:25:44,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:25:44,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:25:44,601 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:25:44,620 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:25:44,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:25:44,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:25:44,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:25:44,622 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:25:44,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:25:44,623 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:25:44,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:25:44,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:25:44,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:25:44,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:25:44,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:25:44,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:25:44,625 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:25:44,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:25:44,625 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:25:44,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:25:44,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:25:44,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:25:44,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:25:44,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:25:44,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:44,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:25:44,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:25:44,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:25:44,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:25:44,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:25:44,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:25:44,629 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad4e6ad99a266ddeead98987e8e44db723af5bc7 [2019-11-28 00:25:44,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:25:44,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:25:44,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:25:44,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:25:44,950 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:25:44,951 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2019-11-28 00:25:45,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9f711bc/82c3221398884560ab40de6869f9a8ef/FLAG1f76d8b8e [2019-11-28 00:25:45,511 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:25:45,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2019-11-28 00:25:45,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9f711bc/82c3221398884560ab40de6869f9a8ef/FLAG1f76d8b8e [2019-11-28 00:25:45,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9f711bc/82c3221398884560ab40de6869f9a8ef [2019-11-28 00:25:45,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:25:45,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:25:45,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:45,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:25:45,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:25:45,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:45" (1/1) ... [2019-11-28 00:25:45,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad64629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:45, skipping insertion in model container [2019-11-28 00:25:45,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:45" (1/1) ... [2019-11-28 00:25:45,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:25:45,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:25:46,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:46,120 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:25:46,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:25:46,148 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:25:46,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46 WrapperNode [2019-11-28 00:25:46,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:25:46,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:46,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:25:46,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:25:46,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:25:46,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:25:46,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:25:46,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:25:46,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... [2019-11-28 00:25:46,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:25:46,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:25:46,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:25:46,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:25:46,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:25:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:25:46,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:25:46,320 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-11-28 00:25:46,321 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-11-28 00:25:46,467 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:25:46,468 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:25:46,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:46 BoogieIcfgContainer [2019-11-28 00:25:46,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:25:46,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:25:46,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:25:46,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:25:46,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:25:45" (1/3) ... [2019-11-28 00:25:46,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a691c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:46, skipping insertion in model container [2019-11-28 00:25:46,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:46" (2/3) ... [2019-11-28 00:25:46,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a691c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:25:46, skipping insertion in model container [2019-11-28 00:25:46,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:46" (3/3) ... [2019-11-28 00:25:46,477 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2019-11-28 00:25:46,486 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:25:46,494 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:25:46,507 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:25:46,534 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:25:46,535 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:25:46,535 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:25:46,535 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:25:46,535 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:25:46,535 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:25:46,536 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:25:46,536 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:25:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-28 00:25:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:25:46,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:46,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:46,559 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:46,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-28 00:25:46,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:46,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587945606] [2019-11-28 00:25:46,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:25:46,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587945606] [2019-11-28 00:25:46,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:25:46,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:25:46,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425355498] [2019-11-28 00:25:46,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:25:46,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:25:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:25:46,973 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-28 00:25:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:47,115 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-28 00:25:47,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:25:47,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 00:25:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:47,126 INFO L225 Difference]: With dead ends: 24 [2019-11-28 00:25:47,127 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 00:25:47,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:25:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 00:25:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 00:25:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 00:25:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-28 00:25:47,165 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-28 00:25:47,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:47,166 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-28 00:25:47,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:25:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-28 00:25:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 00:25:47,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:47,168 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:47,168 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:47,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-28 00:25:47,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:47,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979043456] [2019-11-28 00:25:47,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:25:47,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979043456] [2019-11-28 00:25:47,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486233694] [2019-11-28 00:25:47,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:25:47,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:25:47,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:47,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2019-11-28 00:25:47,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455742803] [2019-11-28 00:25:47,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:25:47,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:47,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:25:47,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:25:47,500 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 10 states. [2019-11-28 00:25:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:47,621 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-28 00:25:47,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:25:47,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-28 00:25:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:47,623 INFO L225 Difference]: With dead ends: 21 [2019-11-28 00:25:47,623 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 00:25:47,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 00:25:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 00:25:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:25:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 00:25:47,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-28 00:25:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:47,637 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 00:25:47,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:25:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 00:25:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 00:25:47,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:47,640 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:47,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:47,841 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:47,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:47,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-28 00:25:47,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:47,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243930685] [2019-11-28 00:25:47,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:25:48,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243930685] [2019-11-28 00:25:48,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533869894] [2019-11-28 00:25:48,019 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:48,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:48,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:48,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:25:48,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:25:48,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:48,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2019-11-28 00:25:48,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45488255] [2019-11-28 00:25:48,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 00:25:48,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:48,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 00:25:48,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:25:48,135 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2019-11-28 00:25:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:48,286 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-28 00:25:48,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:25:48,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-28 00:25:48,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:48,288 INFO L225 Difference]: With dead ends: 24 [2019-11-28 00:25:48,289 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 00:25:48,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:25:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 00:25:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 00:25:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 00:25:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 00:25:48,296 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-28 00:25:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:48,297 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 00:25:48,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 00:25:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-28 00:25:48,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:25:48,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:48,299 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:48,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:48,504 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:48,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-28 00:25:48,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:48,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138870705] [2019-11-28 00:25:48,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 00:25:48,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138870705] [2019-11-28 00:25:48,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931474389] [2019-11-28 00:25:48,747 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:48,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 00:25:48,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:48,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:25:48,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 00:25:48,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:48,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-11-28 00:25:48,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154921730] [2019-11-28 00:25:48,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:25:48,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:48,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:25:48,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:25:48,851 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 12 states. [2019-11-28 00:25:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:48,945 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 00:25:48,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:25:48,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 00:25:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:48,947 INFO L225 Difference]: With dead ends: 27 [2019-11-28 00:25:48,947 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 00:25:48,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:25:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 00:25:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 00:25:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 00:25:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 00:25:48,954 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-28 00:25:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:48,955 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 00:25:48,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:25:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-28 00:25:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:25:48,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:48,956 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:49,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:49,158 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:49,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:49,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-28 00:25:49,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:49,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058735593] [2019-11-28 00:25:49,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 00:25:49,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058735593] [2019-11-28 00:25:49,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368449007] [2019-11-28 00:25:49,404 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:49,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:25:49,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:49,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:25:49,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 00:25:49,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:49,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-28 00:25:49,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485791951] [2019-11-28 00:25:49,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 00:25:49,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 00:25:49,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:25:49,500 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 13 states. [2019-11-28 00:25:49,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:49,598 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 00:25:49,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:25:49,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-11-28 00:25:49,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:49,600 INFO L225 Difference]: With dead ends: 30 [2019-11-28 00:25:49,600 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:25:49,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:25:49,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:25:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 00:25:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:25:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 00:25:49,607 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-28 00:25:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:49,607 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 00:25:49,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 00:25:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 00:25:49,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:25:49,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:49,609 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:49,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:49,815 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:49,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:49,816 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-28 00:25:49,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:49,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68644978] [2019-11-28 00:25:49,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 00:25:50,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68644978] [2019-11-28 00:25:50,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350356910] [2019-11-28 00:25:50,097 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:50,148 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 00:25:50,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:50,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 00:25:50,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 00:25:50,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:50,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2019-11-28 00:25:50,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40205908] [2019-11-28 00:25:50,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:25:50,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:25:50,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:25:50,195 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2019-11-28 00:25:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:50,303 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-28 00:25:50,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:25:50,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-11-28 00:25:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:50,305 INFO L225 Difference]: With dead ends: 33 [2019-11-28 00:25:50,305 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 00:25:50,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:25:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 00:25:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 00:25:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 00:25:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-28 00:25:50,313 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-28 00:25:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:50,313 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-28 00:25:50,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:25:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-28 00:25:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:25:50,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:50,316 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:50,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:50,520 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:50,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-28 00:25:50,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:50,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970564236] [2019-11-28 00:25:50,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 00:25:50,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970564236] [2019-11-28 00:25:50,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62589688] [2019-11-28 00:25:50,811 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:50,864 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 00:25:50,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:50,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:25:50,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 00:25:51,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:51,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 28 [2019-11-28 00:25:51,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981084790] [2019-11-28 00:25:51,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 00:25:51,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:51,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 00:25:51,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:25:51,112 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 28 states. [2019-11-28 00:25:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:51,451 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-28 00:25:51,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 00:25:51,452 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-28 00:25:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:51,454 INFO L225 Difference]: With dead ends: 36 [2019-11-28 00:25:51,454 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 00:25:51,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=1355, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 00:25:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 00:25:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-28 00:25:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 00:25:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-28 00:25:51,461 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-28 00:25:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:51,462 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-28 00:25:51,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 00:25:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-28 00:25:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:25:51,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:51,464 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:51,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:51,674 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:51,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-28 00:25:51,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:51,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395285937] [2019-11-28 00:25:51,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 00:25:52,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395285937] [2019-11-28 00:25:52,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619718271] [2019-11-28 00:25:52,006 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 00:25:52,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 00:25:52,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:52,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2019-11-28 00:25:52,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226382149] [2019-11-28 00:25:52,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 00:25:52,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:52,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 00:25:52,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:25:52,136 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 16 states. [2019-11-28 00:25:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:52,287 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-28 00:25:52,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:25:52,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-11-28 00:25:52,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:52,289 INFO L225 Difference]: With dead ends: 39 [2019-11-28 00:25:52,289 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:25:52,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:25:52,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:25:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 00:25:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 00:25:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-28 00:25:52,302 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-28 00:25:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:52,303 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-28 00:25:52,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 00:25:52,303 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-28 00:25:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 00:25:52,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:52,307 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:52,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:52,511 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:52,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-28 00:25:52,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:52,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646758418] [2019-11-28 00:25:52,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 00:25:52,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646758418] [2019-11-28 00:25:52,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103517422] [2019-11-28 00:25:52,799 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-28 00:25:52,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:52,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:52,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 00:25:52,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 00:25:52,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:52,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2019-11-28 00:25:52,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158416234] [2019-11-28 00:25:52,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 00:25:52,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:52,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 00:25:52,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:25:52,897 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2019-11-28 00:25:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:53,038 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-28 00:25:53,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:25:53,039 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-11-28 00:25:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:53,040 INFO L225 Difference]: With dead ends: 42 [2019-11-28 00:25:53,040 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 00:25:53,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2019-11-28 00:25:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 00:25:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 00:25:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 00:25:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 00:25:53,047 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-28 00:25:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:53,047 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 00:25:53,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 00:25:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 00:25:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:25:53,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:53,049 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:53,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:53,261 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:53,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:53,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-28 00:25:53,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:53,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734683959] [2019-11-28 00:25:53,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-28 00:25:53,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734683959] [2019-11-28 00:25:53,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000830839] [2019-11-28 00:25:53,554 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-28 00:25:53,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 00:25:53,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:53,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 00:25:53,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-28 00:25:54,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:54,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 37 [2019-11-28 00:25:54,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337182451] [2019-11-28 00:25:54,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-28 00:25:54,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:54,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-28 00:25:54,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 00:25:54,071 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 37 states. [2019-11-28 00:25:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:54,562 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-28 00:25:54,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 00:25:54,562 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 63 [2019-11-28 00:25:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:54,563 INFO L225 Difference]: With dead ends: 45 [2019-11-28 00:25:54,563 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 00:25:54,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=537, Invalid=2543, Unknown=0, NotChecked=0, Total=3080 [2019-11-28 00:25:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 00:25:54,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 00:25:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 00:25:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-28 00:25:54,572 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-28 00:25:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:54,572 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-28 00:25:54,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-28 00:25:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-28 00:25:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:25:54,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:54,574 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:54,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:54,777 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:54,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:54,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-28 00:25:54,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:54,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779339124] [2019-11-28 00:25:54,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-28 00:25:55,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779339124] [2019-11-28 00:25:55,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060683055] [2019-11-28 00:25:55,208 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-28 00:25:55,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:25:55,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:55,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 00:25:55,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-28 00:25:55,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:55,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 19 [2019-11-28 00:25:55,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136426567] [2019-11-28 00:25:55,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 00:25:55,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:55,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 00:25:55,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:25:55,347 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 19 states. [2019-11-28 00:25:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:55,506 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-28 00:25:55,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:25:55,507 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2019-11-28 00:25:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:55,508 INFO L225 Difference]: With dead ends: 48 [2019-11-28 00:25:55,508 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 00:25:55,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2019-11-28 00:25:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 00:25:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-28 00:25:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 00:25:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-28 00:25:55,522 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-28 00:25:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:55,524 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-28 00:25:55,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 00:25:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-28 00:25:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 00:25:55,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:55,530 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:55,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:55,742 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:55,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:55,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-28 00:25:55,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:55,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888596609] [2019-11-28 00:25:55,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-28 00:25:56,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888596609] [2019-11-28 00:25:56,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974463384] [2019-11-28 00:25:56,221 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-28 00:25:56,274 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 00:25:56,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:56,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 00:25:56,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-28 00:25:56,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:56,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 20 [2019-11-28 00:25:56,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278110322] [2019-11-28 00:25:56,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 00:25:56,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:56,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 00:25:56,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:25:56,352 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 20 states. [2019-11-28 00:25:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:56,551 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-28 00:25:56,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 00:25:56,552 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2019-11-28 00:25:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:56,553 INFO L225 Difference]: With dead ends: 51 [2019-11-28 00:25:56,553 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:25:56,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=683, Unknown=0, NotChecked=0, Total=992 [2019-11-28 00:25:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:25:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:25:56,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:25:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-28 00:25:56,560 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-28 00:25:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:56,561 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-28 00:25:56,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 00:25:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-28 00:25:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 00:25:56,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:56,562 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:56,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:56,769 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:56,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:56,770 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-28 00:25:56,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:56,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615992967] [2019-11-28 00:25:56,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-28 00:25:57,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615992967] [2019-11-28 00:25:57,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606685415] [2019-11-28 00:25:57,188 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:57,241 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 00:25:57,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:57,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 00:25:57,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-28 00:25:57,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:57,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2019-11-28 00:25:57,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570605464] [2019-11-28 00:25:57,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 00:25:57,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:57,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 00:25:57,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:25:57,305 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 21 states. [2019-11-28 00:25:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:57,496 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 00:25:57,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 00:25:57,497 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-11-28 00:25:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:57,498 INFO L225 Difference]: With dead ends: 54 [2019-11-28 00:25:57,498 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 00:25:57,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=353, Invalid=769, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 00:25:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 00:25:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 00:25:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 00:25:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 00:25:57,512 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-28 00:25:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:57,512 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 00:25:57,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 00:25:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 00:25:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 00:25:57,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:57,515 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:57,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:57,720 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:57,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:57,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-28 00:25:57,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:57,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593415449] [2019-11-28 00:25:57,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-28 00:25:58,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593415449] [2019-11-28 00:25:58,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526956350] [2019-11-28 00:25:58,245 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 00:25:58,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-28 00:25:58,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:58,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 22 [2019-11-28 00:25:58,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570939172] [2019-11-28 00:25:58,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 00:25:58,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:58,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 00:25:58,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:25:58,418 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 22 states. [2019-11-28 00:25:58,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:58,629 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-28 00:25:58,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:25:58,629 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-11-28 00:25:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:58,631 INFO L225 Difference]: With dead ends: 57 [2019-11-28 00:25:58,631 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 00:25:58,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=400, Invalid=860, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 00:25:58,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 00:25:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 00:25:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 00:25:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-28 00:25:58,644 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-28 00:25:58,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:58,645 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-28 00:25:58,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 00:25:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-28 00:25:58,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 00:25:58,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:58,647 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:58,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:58,848 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:58,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:58,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-28 00:25:58,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:58,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890378838] [2019-11-28 00:25:58,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:25:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-28 00:25:59,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890378838] [2019-11-28 00:25:59,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24025476] [2019-11-28 00:25:59,351 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:59,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:25:59,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:25:59,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 00:25:59,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:25:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-28 00:25:59,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:25:59,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 23 [2019-11-28 00:25:59,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469508999] [2019-11-28 00:25:59,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 00:25:59,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:25:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 00:25:59,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-11-28 00:25:59,473 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 23 states. [2019-11-28 00:25:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:25:59,753 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-28 00:25:59,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 00:25:59,754 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 93 [2019-11-28 00:25:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:25:59,755 INFO L225 Difference]: With dead ends: 60 [2019-11-28 00:25:59,755 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 00:25:59,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=450, Invalid=956, Unknown=0, NotChecked=0, Total=1406 [2019-11-28 00:25:59,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 00:25:59,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 00:25:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:25:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-28 00:25:59,767 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-28 00:25:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:25:59,771 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-28 00:25:59,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 00:25:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-28 00:25:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 00:25:59,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:25:59,774 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:25:59,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:25:59,979 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:25:59,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:25:59,980 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-28 00:25:59,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:25:59,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878574986] [2019-11-28 00:25:59,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:25:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:26:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:26:00,036 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:26:00,036 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:26:00,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:26:00 BoogieIcfgContainer [2019-11-28 00:26:00,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:26:00,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:26:00,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:26:00,103 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:26:00,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:46" (3/4) ... [2019-11-28 00:26:00,106 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:26:00,207 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:26:00,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:26:00,210 INFO L168 Benchmark]: Toolchain (without parser) took 14302.56 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 351.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 204.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:00,210 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:00,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.41 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 940.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:00,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 940.2 MB in the beginning and 1.2 GB in the end (delta: -217.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:00,212 INFO L168 Benchmark]: Boogie Preprocessor took 19.67 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:00,212 INFO L168 Benchmark]: RCFGBuilder took 205.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:00,213 INFO L168 Benchmark]: TraceAbstraction took 13631.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.0 MB). Peak memory consumption was 231.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:00,213 INFO L168 Benchmark]: Witness Printer took 105.02 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:00,216 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 241.41 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 940.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 940.2 MB in the beginning and 1.2 GB in the end (delta: -217.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.67 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 205.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13631.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.0 MB). Peak memory consumption was 231.5 MB. Max. memory is 11.5 GB. * Witness Printer took 105.02 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 15; [L11] CALL, EXPR id(input) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 15 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Result: UNSAFE, OverallTime: 13.5s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 136 SDtfs, 394 SDslu, 858 SDs, 0 SdLazy, 883 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1297 GetRequests, 922 SyntacticMatches, 0 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1868 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 1492 ConstructedInterpolants, 0 QuantifiedInterpolants, 246272 SizeOfPredicates, 116 NumberOfNonLiveVariables, 1806 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 29 InterpolantComputations, 1 PerfectInterpolantSequences, 3150/6300 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 incorrect! Received shutdown request...