./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/fibo_2calls_5-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 fe571d33601eb001defa960d70b02ea99b59263c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-11-28 17:29:20,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:29:20,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:29:20,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:29:20,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:29:20,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:29:20,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:29:20,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:29:20,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:29:20,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:29:20,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:29:20,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:29:20,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:29:20,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:29:20,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:29:20,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:29:20,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:29:20,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:29:20,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:29:20,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:29:20,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:29:20,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:29:20,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:29:20,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:29:20,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:29:20,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:29:20,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:29:20,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:29:20,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:29:20,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:29:20,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:29:20,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:29:20,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:29:20,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:29:20,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:29:20,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:29:20,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:29:20,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:29:20,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:29:20,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:29:20,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:29:20,511 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:29:20,537 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:29:20,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:29:20,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:29:20,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:29:20,542 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:29:20,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:29:20,543 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:29:20,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:29:20,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:29:20,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:29:20,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:29:20,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:29:20,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:29:20,546 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:29:20,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:29:20,547 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:29:20,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:29:20,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:29:20,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:29:20,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:29:20,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:29:20,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:29:20,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:29:20,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:29:20,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:29:20,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:29:20,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:29:20,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:29:20,551 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:29:20,551 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 -> fe571d33601eb001defa960d70b02ea99b59263c [2019-11-28 17:29:20,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:29:20,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:29:20,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:29:20,935 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:29:20,935 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:29:20,936 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2019-11-28 17:29:20,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890d9dd1a/0b0c2b55010f4b1abe4a6103e6eea1ed/FLAG01ffdc88a [2019-11-28 17:29:21,433 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:29:21,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2019-11-28 17:29:21,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890d9dd1a/0b0c2b55010f4b1abe4a6103e6eea1ed/FLAG01ffdc88a [2019-11-28 17:29:21,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890d9dd1a/0b0c2b55010f4b1abe4a6103e6eea1ed [2019-11-28 17:29:21,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:29:21,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:29:21,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:21,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:29:21,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:29:21,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:21" (1/1) ... [2019-11-28 17:29:21,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33519a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:21, skipping insertion in model container [2019-11-28 17:29:21,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:21" (1/1) ... [2019-11-28 17:29:21,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:29:21,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:29:22,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:22,118 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:29:22,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:22,156 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:29:22,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22 WrapperNode [2019-11-28 17:29:22,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:22,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:22,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:29:22,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:29:22,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22" (1/1) ... [2019-11-28 17:29:22,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22" (1/1) ... [2019-11-28 17:29:22,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:22,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:29:22,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:29:22,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:29:22,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22" (1/1) ... [2019-11-28 17:29:22,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22" (1/1) ... [2019-11-28 17:29:22,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22" (1/1) ... [2019-11-28 17:29:22,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22" (1/1) ... [2019-11-28 17:29:22,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22" (1/1) ... [2019-11-28 17:29:22,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22" (1/1) ... [2019-11-28 17:29:22,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22" (1/1) ... [2019-11-28 17:29:22,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:29:22,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:29:22,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:29:22,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:29:22,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22" (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 17:29:22,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:29:22,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:29:22,345 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-28 17:29:22,345 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-28 17:29:22,346 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-28 17:29:22,346 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-28 17:29:22,538 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:29:22,539 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:29:22,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:22 BoogieIcfgContainer [2019-11-28 17:29:22,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:29:22,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:29:22,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:29:22,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:29:22,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:29:21" (1/3) ... [2019-11-28 17:29:22,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73da58b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:22, skipping insertion in model container [2019-11-28 17:29:22,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:22" (2/3) ... [2019-11-28 17:29:22,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73da58b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:22, skipping insertion in model container [2019-11-28 17:29:22,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:22" (3/3) ... [2019-11-28 17:29:22,553 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2019-11-28 17:29:22,588 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:29:22,603 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:29:22,619 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:29:22,672 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:29:22,672 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:29:22,672 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:29:22,673 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:29:22,673 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:29:22,673 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:29:22,673 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:29:22,673 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:29:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 17:29:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:29:22,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:22,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:22,697 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:22,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:22,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-28 17:29:22,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:22,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203635447] [2019-11-28 17:29:22,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:22,977 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 17:29:22,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203635447] [2019-11-28 17:29:22,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:22,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:29:22,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835211521] [2019-11-28 17:29:22,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:29:22,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:23,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:29:23,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:29:23,011 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-11-28 17:29:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:23,156 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-28 17:29:23,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:29:23,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 17:29:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:23,170 INFO L225 Difference]: With dead ends: 38 [2019-11-28 17:29:23,170 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 17:29:23,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:29:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 17:29:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 17:29:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:29:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 17:29:23,219 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-28 17:29:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:23,220 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 17:29:23,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:29:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 17:29:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:29:23,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:23,222 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:23,222 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:23,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:23,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-28 17:29:23,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:23,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828528866] [2019-11-28 17:29:23,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,315 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 17:29:23,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828528866] [2019-11-28 17:29:23,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:23,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:29:23,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123057979] [2019-11-28 17:29:23,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:29:23,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:23,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:29:23,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:29:23,320 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-11-28 17:29:23,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:23,404 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-28 17:29:23,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:29:23,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-28 17:29:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:23,406 INFO L225 Difference]: With dead ends: 32 [2019-11-28 17:29:23,406 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 17:29:23,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:29:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 17:29:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 17:29:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:29:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 17:29:23,419 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-28 17:29:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:23,421 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 17:29:23,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:29:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 17:29:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:29:23,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:23,424 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:23,424 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:23,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-28 17:29:23,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:23,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356082454] [2019-11-28 17:29:23,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:29:23,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356082454] [2019-11-28 17:29:23,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176781058] [2019-11-28 17:29:23,658 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 17:29:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:29:23,737 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:29:23,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:23,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-28 17:29:23,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313419960] [2019-11-28 17:29:23,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:23,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:23,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:23,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:23,821 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-11-28 17:29:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:24,018 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-28 17:29:24,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:29:24,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-28 17:29:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:24,022 INFO L225 Difference]: With dead ends: 59 [2019-11-28 17:29:24,022 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 17:29:24,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:29:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 17:29:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 17:29:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 17:29:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-28 17:29:24,042 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-28 17:29:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:24,044 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-28 17:29:24,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-28 17:29:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:29:24,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:24,048 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:24,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:24,254 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:24,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-28 17:29:24,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:24,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978254596] [2019-11-28 17:29:24,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:29:24,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978254596] [2019-11-28 17:29:24,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575371549] [2019-11-28 17:29:24,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 17:29:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,446 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:29:24,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:29:24,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:24,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-28 17:29:24,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524179134] [2019-11-28 17:29:24,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:24,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:24,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:24,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:24,497 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-11-28 17:29:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:24,748 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-28 17:29:24,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:29:24,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-28 17:29:24,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:24,756 INFO L225 Difference]: With dead ends: 55 [2019-11-28 17:29:24,762 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 17:29:24,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:29:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 17:29:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-28 17:29:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 17:29:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-28 17:29:24,789 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-28 17:29:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:24,790 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-28 17:29:24,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-28 17:29:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:29:24,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:24,798 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:25,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:25,001 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:25,002 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-28 17:29:25,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:25,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758754279] [2019-11-28 17:29:25,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 17:29:25,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758754279] [2019-11-28 17:29:25,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792931584] [2019-11-28 17:29:25,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 17:29:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,244 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:25,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:29:25,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:25,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-11-28 17:29:25,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357841394] [2019-11-28 17:29:25,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:29:25,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:25,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:29:25,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:29:25,328 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-11-28 17:29:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:25,784 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-28 17:29:25,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 17:29:25,785 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-11-28 17:29:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:25,788 INFO L225 Difference]: With dead ends: 114 [2019-11-28 17:29:25,788 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 17:29:25,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:29:25,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 17:29:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 17:29:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:29:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-28 17:29:25,806 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-28 17:29:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:25,806 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-28 17:29:25,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:29:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-28 17:29:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 17:29:25,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:25,809 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:26,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:26,013 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:26,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:26,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-28 17:29:26,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:26,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323200456] [2019-11-28 17:29:26,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 17:29:26,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323200456] [2019-11-28 17:29:26,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584732873] [2019-11-28 17:29:26,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 17:29:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:26,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 17:29:26,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:26,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-28 17:29:26,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650630809] [2019-11-28 17:29:26,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:29:26,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:26,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:29:26,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:29:26,275 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-11-28 17:29:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:26,597 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-28 17:29:26,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:29:26,598 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-28 17:29:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:26,600 INFO L225 Difference]: With dead ends: 147 [2019-11-28 17:29:26,600 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 17:29:26,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:29:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 17:29:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-28 17:29:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:29:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-28 17:29:26,622 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-28 17:29:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:26,622 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-28 17:29:26,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:29:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-28 17:29:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:29:26,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:26,625 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:26,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:26,831 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:26,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:26,831 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-28 17:29:26,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:26,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987030657] [2019-11-28 17:29:26,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 17:29:27,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987030657] [2019-11-28 17:29:27,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476159186] [2019-11-28 17:29:27,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 17:29:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:27,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:27,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 17:29:27,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:27,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-11-28 17:29:27,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828025733] [2019-11-28 17:29:27,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 17:29:27,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:27,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 17:29:27,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:29:27,189 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-11-28 17:29:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:27,735 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-28 17:29:27,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 17:29:27,735 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-28 17:29:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:27,737 INFO L225 Difference]: With dead ends: 164 [2019-11-28 17:29:27,737 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 17:29:27,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-28 17:29:27,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 17:29:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-28 17:29:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 17:29:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-28 17:29:27,756 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-28 17:29:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:27,757 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-28 17:29:27,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 17:29:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-28 17:29:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 17:29:27,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:27,762 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:27,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:27,966 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:27,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:27,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-11-28 17:29:27,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:27,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891869602] [2019-11-28 17:29:27,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-28 17:29:28,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891869602] [2019-11-28 17:29:28,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149530584] [2019-11-28 17:29:28,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 17:29:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,420 INFO L264 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:28,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 23 proven. 65 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-28 17:29:28,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:28,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2019-11-28 17:29:28,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291341728] [2019-11-28 17:29:28,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 17:29:28,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:28,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 17:29:28,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:29:28,525 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 19 states. [2019-11-28 17:29:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:29,114 INFO L93 Difference]: Finished difference Result 222 states and 415 transitions. [2019-11-28 17:29:29,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 17:29:29,114 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2019-11-28 17:29:29,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:29,120 INFO L225 Difference]: With dead ends: 222 [2019-11-28 17:29:29,121 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 17:29:29,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2019-11-28 17:29:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 17:29:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2019-11-28 17:29:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 17:29:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-11-28 17:29:29,167 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 91 [2019-11-28 17:29:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:29,168 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-11-28 17:29:29,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 17:29:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-11-28 17:29:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 17:29:29,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:29,171 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:29,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:29,388 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:29,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:29,389 INFO L82 PathProgramCache]: Analyzing trace with hash 358391620, now seen corresponding path program 1 times [2019-11-28 17:29:29,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:29,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964174538] [2019-11-28 17:29:29,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 84 proven. 79 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-28 17:29:29,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964174538] [2019-11-28 17:29:29,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805139200] [2019-11-28 17:29:29,840 INFO L94 rtionOrderModulation]: Keeping assertion order 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 17:29:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,894 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 17:29:29,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 66 proven. 52 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-28 17:29:30,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:30,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 22 [2019-11-28 17:29:30,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076957549] [2019-11-28 17:29:30,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 17:29:30,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:30,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 17:29:30,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:29:30,037 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 22 states. [2019-11-28 17:29:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:30,811 INFO L93 Difference]: Finished difference Result 304 states and 608 transitions. [2019-11-28 17:29:30,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 17:29:30,812 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 105 [2019-11-28 17:29:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:30,819 INFO L225 Difference]: With dead ends: 304 [2019-11-28 17:29:30,820 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 17:29:30,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2019-11-28 17:29:30,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 17:29:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 130. [2019-11-28 17:29:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 17:29:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 209 transitions. [2019-11-28 17:29:30,868 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 209 transitions. Word has length 105 [2019-11-28 17:29:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:30,870 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 209 transitions. [2019-11-28 17:29:30,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 17:29:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 209 transitions. [2019-11-28 17:29:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 17:29:30,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:30,876 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:31,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:31,090 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1449179333, now seen corresponding path program 2 times [2019-11-28 17:29:31,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:31,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333157238] [2019-11-28 17:29:31,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-28 17:29:31,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333157238] [2019-11-28 17:29:31,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494003678] [2019-11-28 17:29:31,257 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 17:29:31,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:29:31,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:31,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 17:29:31,327 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-28 17:29:31,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:29:31,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2019-11-28 17:29:31,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944132011] [2019-11-28 17:29:31,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:29:31,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:31,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:29:31,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:29:31,384 INFO L87 Difference]: Start difference. First operand 130 states and 209 transitions. Second operand 6 states. [2019-11-28 17:29:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:31,441 INFO L93 Difference]: Finished difference Result 236 states and 406 transitions. [2019-11-28 17:29:31,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:29:31,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-11-28 17:29:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:31,444 INFO L225 Difference]: With dead ends: 236 [2019-11-28 17:29:31,445 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 17:29:31,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:29:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 17:29:31,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-11-28 17:29:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 17:29:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2019-11-28 17:29:31,458 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 104 [2019-11-28 17:29:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:31,459 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2019-11-28 17:29:31,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:29:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2019-11-28 17:29:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-28 17:29:31,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:31,462 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:31,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:31,673 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:31,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash 311986411, now seen corresponding path program 3 times [2019-11-28 17:29:31,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:31,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274652648] [2019-11-28 17:29:31,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 92 proven. 147 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-11-28 17:29:32,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274652648] [2019-11-28 17:29:32,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048536908] [2019-11-28 17:29:32,269 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 17:29:32,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 17:29:32,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:32,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:32,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 127 proven. 29 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-11-28 17:29:32,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:32,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 27 [2019-11-28 17:29:32,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881215541] [2019-11-28 17:29:32,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 17:29:32,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:32,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 17:29:32,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2019-11-28 17:29:32,523 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand 27 states. [2019-11-28 17:29:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:33,348 INFO L93 Difference]: Finished difference Result 245 states and 416 transitions. [2019-11-28 17:29:33,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 17:29:33,349 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2019-11-28 17:29:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:33,351 INFO L225 Difference]: With dead ends: 245 [2019-11-28 17:29:33,351 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 17:29:33,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 17:29:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 17:29:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 115. [2019-11-28 17:29:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 17:29:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2019-11-28 17:29:33,365 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 132 [2019-11-28 17:29:33,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:33,366 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2019-11-28 17:29:33,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 17:29:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2019-11-28 17:29:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 17:29:33,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:33,368 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:33,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:33,572 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:33,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:33,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1882786525, now seen corresponding path program 4 times [2019-11-28 17:29:33,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:33,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978409560] [2019-11-28 17:29:33,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 60 proven. 49 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-28 17:29:33,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978409560] [2019-11-28 17:29:33,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462481697] [2019-11-28 17:29:33,867 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 17:29:33,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:29:33,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:33,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:33,912 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-28 17:29:33,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:33,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 21 [2019-11-28 17:29:33,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081550351] [2019-11-28 17:29:33,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 17:29:33,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:33,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 17:29:33,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-11-28 17:29:33,997 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 21 states. [2019-11-28 17:29:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:34,441 INFO L93 Difference]: Finished difference Result 245 states and 346 transitions. [2019-11-28 17:29:34,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 17:29:34,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 91 [2019-11-28 17:29:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:34,443 INFO L225 Difference]: With dead ends: 245 [2019-11-28 17:29:34,444 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 17:29:34,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2019-11-28 17:29:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 17:29:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2019-11-28 17:29:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 17:29:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 156 transitions. [2019-11-28 17:29:34,455 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 156 transitions. Word has length 91 [2019-11-28 17:29:34,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:34,456 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 156 transitions. [2019-11-28 17:29:34,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 17:29:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 156 transitions. [2019-11-28 17:29:34,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 17:29:34,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:34,458 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:34,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:34,662 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:34,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:34,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1335172610, now seen corresponding path program 5 times [2019-11-28 17:29:34,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:34,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815372647] [2019-11-28 17:29:34,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:29:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:29:34,706 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:29:34,706 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:29:34,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:29:34 BoogieIcfgContainer [2019-11-28 17:29:34,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:29:34,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:29:34,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:29:34,760 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:29:34,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:22" (3/4) ... [2019-11-28 17:29:34,763 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:29:34,868 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:29:34,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:29:34,871 INFO L168 Benchmark]: Toolchain (without parser) took 13059.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 961.7 MB in the beginning and 955.6 MB in the end (delta: 6.2 MB). Peak memory consumption was 283.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:34,871 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:29:34,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.98 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:34,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -130.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:34,872 INFO L168 Benchmark]: Boogie Preprocessor took 23.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:34,873 INFO L168 Benchmark]: RCFGBuilder took 258.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:34,873 INFO L168 Benchmark]: TraceAbstraction took 12218.07 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 955.6 MB in the end (delta: 107.2 MB). Peak memory consumption was 297.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:34,874 INFO L168 Benchmark]: Witness Printer took 108.64 ms. Allocated memory is still 1.3 GB. Free memory was 955.6 MB in the beginning and 955.6 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 17:29:34,876 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.98 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -130.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 258.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12218.07 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 955.6 MB in the end (delta: 107.2 MB). Peak memory consumption was 297.5 MB. Max. memory is 11.5 GB. * Witness Printer took 108.64 ms. Allocated memory is still 1.3 GB. Free memory was 955.6 MB in the beginning and 955.6 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 5; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 5 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 12.0s, OverallIterations: 13, TraceHistogramMax: 10, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 311 SDtfs, 557 SDslu, 2231 SDs, 0 SdLazy, 3865 SolverSat, 537 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 871 SyntacticMatches, 3 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 124 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1502 NumberOfCodeBlocks, 1434 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1375 ConstructedInterpolants, 0 QuantifiedInterpolants, 220661 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1398 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 2277/2852 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...