./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.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_6-1.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 595c6555624af5bbcf79585a20acb2500e3eeee8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:29:26,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:29:26,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:29:26,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:29:26,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:29:26,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:29:26,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:29:26,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:29:26,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:29:26,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:29:26,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:29:26,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:29:26,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:29:26,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:29:26,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:29:26,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:29:26,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:29:26,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:29:26,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:29:26,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:29:26,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:29:26,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:29:26,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:29:26,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:29:26,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:29:26,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:29:26,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:29:26,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:29:26,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:29:26,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:29:26,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:29:26,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:29:26,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:29:26,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:29:26,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:29:26,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:29:26,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:29:26,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:29:26,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:29:26,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:29:26,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:29:26,134 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:26,165 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:29:26,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:29:26,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:29:26,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:29:26,168 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:29:26,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:29:26,168 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:29:26,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:29:26,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:29:26,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:29:26,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:29:26,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:29:26,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:29:26,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:29:26,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:29:26,172 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:29:26,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:29:26,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:29:26,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:29:26,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:29:26,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:29:26,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:29:26,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:29:26,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:29:26,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:29:26,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:29:26,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:29:26,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:29:26,177 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:29:26,177 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 -> 595c6555624af5bbcf79585a20acb2500e3eeee8 [2019-11-28 17:29:26,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:29:26,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:29:26,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:29:26,506 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:29:26,507 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:29:26,508 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2019-11-28 17:29:26,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f116463c9/fcadc733cdc84b0eb7cd2f823d304a3b/FLAG10b941720 [2019-11-28 17:29:27,067 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:29:27,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2019-11-28 17:29:27,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f116463c9/fcadc733cdc84b0eb7cd2f823d304a3b/FLAG10b941720 [2019-11-28 17:29:27,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f116463c9/fcadc733cdc84b0eb7cd2f823d304a3b [2019-11-28 17:29:27,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:29:27,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:29:27,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:27,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:29:27,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:29:27,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:27" (1/1) ... [2019-11-28 17:29:27,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a18cc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:27, skipping insertion in model container [2019-11-28 17:29:27,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:27" (1/1) ... [2019-11-28 17:29:27,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:29:27,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:29:27,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:27,734 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:29:27,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:27,760 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:29:27,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:27 WrapperNode [2019-11-28 17:29:27,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:27,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:27,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:29:27,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:29:27,770 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:27" (1/1) ... [2019-11-28 17:29:27,775 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:27" (1/1) ... [2019-11-28 17:29:27,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:27,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:29:27,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:29:27,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:29:27,866 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:27" (1/1) ... [2019-11-28 17:29:27,866 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:27" (1/1) ... [2019-11-28 17:29:27,867 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:27" (1/1) ... [2019-11-28 17:29:27,867 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:27" (1/1) ... [2019-11-28 17:29:27,869 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:27" (1/1) ... [2019-11-28 17:29:27,872 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:27" (1/1) ... [2019-11-28 17:29:27,872 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:27" (1/1) ... [2019-11-28 17:29:27,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:29:27,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:29:27,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:29:27,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:29:27,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:27" (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:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:29:27,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:29:27,937 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-28 17:29:27,938 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-28 17:29:27,938 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-28 17:29:27,938 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-28 17:29:28,155 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:29:28,155 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:29:28,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:28 BoogieIcfgContainer [2019-11-28 17:29:28,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:29:28,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:29:28,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:29:28,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:29:28,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:29:27" (1/3) ... [2019-11-28 17:29:28,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d38f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:28, skipping insertion in model container [2019-11-28 17:29:28,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:27" (2/3) ... [2019-11-28 17:29:28,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d38f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:28, skipping insertion in model container [2019-11-28 17:29:28,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:28" (3/3) ... [2019-11-28 17:29:28,189 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2019-11-28 17:29:28,211 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:29:28,228 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:29:28,254 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:29:28,283 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:29:28,283 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:29:28,284 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:29:28,284 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:29:28,284 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:29:28,284 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:29:28,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:29:28,284 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:29:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 17:29:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:29:28,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:28,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:28,306 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:28,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-28 17:29:28,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:28,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668802944] [2019-11-28 17:29:28,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,545 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:28,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668802944] [2019-11-28 17:29:28,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:28,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:29:28,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276535832] [2019-11-28 17:29:28,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:29:28,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:28,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:29:28,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:29:28,573 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-11-28 17:29:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:28,691 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-28 17:29:28,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:29:28,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 17:29:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:28,704 INFO L225 Difference]: With dead ends: 38 [2019-11-28 17:29:28,704 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 17:29:28,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:29:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 17:29:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 17:29:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:29:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 17:29:28,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-28 17:29:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:28,756 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 17:29:28,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:29:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 17:29:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:29:28,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:28,759 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:28,760 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:28,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:28,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-28 17:29:28,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:28,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143102000] [2019-11-28 17:29:28,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,838 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:28,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143102000] [2019-11-28 17:29:28,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:28,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:29:28,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263689259] [2019-11-28 17:29:28,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:29:28,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:28,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:29:28,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:29:28,845 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-11-28 17:29:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:28,939 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-28 17:29:28,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:29:28,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 17:29:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:28,942 INFO L225 Difference]: With dead ends: 32 [2019-11-28 17:29:28,943 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 17:29:28,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:29:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 17:29:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 17:29:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:29:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 17:29:28,963 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-28 17:29:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:28,964 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 17:29:28,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:29:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 17:29:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:29:28,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:28,967 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:28,967 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:28,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-28 17:29:28,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:28,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300193971] [2019-11-28 17:29:28,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,203 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:29,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300193971] [2019-11-28 17:29:29,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354212930] [2019-11-28 17:29:29,207 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:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,252 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:29:29,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:29,330 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:29,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:29,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-28 17:29:29,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137049605] [2019-11-28 17:29:29,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:29:29,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:29,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:29:29,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:29:29,333 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 10 states. [2019-11-28 17:29:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:29,507 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-28 17:29:29,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:29:29,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 17:29:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:29,510 INFO L225 Difference]: With dead ends: 59 [2019-11-28 17:29:29,510 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 17:29:29,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:29:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 17:29:29,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 17:29:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 17:29:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-28 17:29:29,522 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-28 17:29:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:29,522 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-28 17:29:29,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:29:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-28 17:29:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:29:29,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:29,525 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:29,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:29,729 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:29,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-28 17:29:29,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:29,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933193991] [2019-11-28 17:29:29,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,885 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:29,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933193991] [2019-11-28 17:29:29,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255276070] [2019-11-28 17:29:29,886 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:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:29:29,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:29,974 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:29,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:29,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-28 17:29:29,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587419379] [2019-11-28 17:29:29,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:29:29,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:29,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:29:29,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:29:29,980 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 10 states. [2019-11-28 17:29:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:30,214 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-28 17:29:30,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:29:30,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 17:29:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:30,222 INFO L225 Difference]: With dead ends: 55 [2019-11-28 17:29:30,223 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 17:29:30,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:29:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 17:29:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-28 17:29:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 17:29:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-28 17:29:30,243 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-28 17:29:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:30,244 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-28 17:29:30,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:29:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-28 17:29:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:29:30,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:30,247 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:30,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:30,459 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-28 17:29:30,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:30,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742026311] [2019-11-28 17:29:30,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,637 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:30,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742026311] [2019-11-28 17:29:30,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24023820] [2019-11-28 17:29:30,639 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:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:30,688 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:30,770 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:30,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:30,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-28 17:29:30,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539667028] [2019-11-28 17:29:30,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:30,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:30,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:30,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:30,773 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 12 states. [2019-11-28 17:29:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:31,104 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-28 17:29:31,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 17:29:31,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-28 17:29:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:31,109 INFO L225 Difference]: With dead ends: 114 [2019-11-28 17:29:31,110 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 17:29:31,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-11-28 17:29:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 17:29:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 17:29:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:29:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-28 17:29:31,129 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-28 17:29:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:31,130 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-28 17:29:31,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-28 17:29:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 17:29:31,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:31,133 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:31,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:31,337 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:31,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-28 17:29:31,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:31,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73632525] [2019-11-28 17:29:31,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,543 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:31,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73632525] [2019-11-28 17:29:31,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361168311] [2019-11-28 17:29:31,544 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:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,586 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:31,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:31,645 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:31,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:31,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-11-28 17:29:31,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165977017] [2019-11-28 17:29:31,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:31,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:31,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:31,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:31,647 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 12 states. [2019-11-28 17:29:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:31,933 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-28 17:29:31,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:29:31,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-28 17:29:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:31,942 INFO L225 Difference]: With dead ends: 147 [2019-11-28 17:29:31,944 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 17:29:31,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:29:31,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 17:29:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-28 17:29:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:29:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-28 17:29:31,962 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-28 17:29:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:31,963 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-28 17:29:31,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-28 17:29:31,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:29:31,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:31,966 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:32,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:32,171 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-28 17:29:32,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:32,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529632450] [2019-11-28 17:29:32,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,370 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:32,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529632450] [2019-11-28 17:29:32,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195813462] [2019-11-28 17:29:32,371 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:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,442 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:32,445 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:32,533 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:32,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:32,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-28 17:29:32,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56394343] [2019-11-28 17:29:32,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 17:29:32,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:32,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 17:29:32,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:29:32,536 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 16 states. [2019-11-28 17:29:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:33,090 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-28 17:29:33,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 17:29:33,091 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-11-28 17:29:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:33,093 INFO L225 Difference]: With dead ends: 164 [2019-11-28 17:29:33,093 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 17:29:33,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:29:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 17:29:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-28 17:29:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 17:29:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-28 17:29:33,114 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-28 17:29:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:33,114 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-28 17:29:33,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 17:29:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-28 17:29:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 17:29:33,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:33,119 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:33,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:33,330 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:33,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:33,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-11-28 17:29:33,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:33,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574769909] [2019-11-28 17:29:33,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,627 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:33,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574769909] [2019-11-28 17:29:33,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421556756] [2019-11-28 17:29:33,628 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:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:33,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 17:29:33,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 13 proven. 90 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-28 17:29:33,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:33,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-28 17:29:33,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924949519] [2019-11-28 17:29:33,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 17:29:33,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:33,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 17:29:33,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:29:33,802 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 18 states. [2019-11-28 17:29:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:34,456 INFO L93 Difference]: Finished difference Result 207 states and 388 transitions. [2019-11-28 17:29:34,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 17:29:34,459 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-11-28 17:29:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:34,462 INFO L225 Difference]: With dead ends: 207 [2019-11-28 17:29:34,462 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 17:29:34,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2019-11-28 17:29:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 17:29:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2019-11-28 17:29:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 17:29:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2019-11-28 17:29:34,479 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 91 [2019-11-28 17:29:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:34,480 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2019-11-28 17:29:34,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 17:29:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2019-11-28 17:29:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-28 17:29:34,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:34,483 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:34,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:34,694 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:34,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:34,694 INFO L82 PathProgramCache]: Analyzing trace with hash -463941571, now seen corresponding path program 1 times [2019-11-28 17:29:34,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:34,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868284473] [2019-11-28 17:29:34,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 53 proven. 117 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-28 17:29:35,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868284473] [2019-11-28 17:29:35,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462096543] [2019-11-28 17:29:35,051 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:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:35,124 INFO L264 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:35,149 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 89 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-11-28 17:29:35,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:35,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2019-11-28 17:29:35,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781690866] [2019-11-28 17:29:35,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 17:29:35,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:35,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 17:29:35,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:29:35,267 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand 18 states. [2019-11-28 17:29:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:35,755 INFO L93 Difference]: Finished difference Result 209 states and 348 transitions. [2019-11-28 17:29:35,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 17:29:35,756 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 119 [2019-11-28 17:29:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:35,759 INFO L225 Difference]: With dead ends: 209 [2019-11-28 17:29:35,759 INFO L226 Difference]: Without dead ends: 121 [2019-11-28 17:29:35,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:29:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-28 17:29:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2019-11-28 17:29:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-28 17:29:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 175 transitions. [2019-11-28 17:29:35,776 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 175 transitions. Word has length 119 [2019-11-28 17:29:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:35,777 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 175 transitions. [2019-11-28 17:29:35,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 17:29:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 175 transitions. [2019-11-28 17:29:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-28 17:29:35,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:35,782 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 14, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:35,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:35,987 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:35,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1957575691, now seen corresponding path program 2 times [2019-11-28 17:29:35,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:35,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475669997] [2019-11-28 17:29:35,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 467 proven. 589 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2019-11-28 17:29:36,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475669997] [2019-11-28 17:29:36,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350845791] [2019-11-28 17:29:36,942 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:37,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:29:37,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:37,035 INFO L264 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 17:29:37,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 174 proven. 310 refuted. 0 times theorem prover too weak. 1519 trivial. 0 not checked. [2019-11-28 17:29:37,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:37,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11] total 28 [2019-11-28 17:29:37,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587655263] [2019-11-28 17:29:37,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 17:29:37,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:37,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 17:29:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2019-11-28 17:29:37,194 INFO L87 Difference]: Start difference. First operand 111 states and 175 transitions. Second operand 28 states. [2019-11-28 17:29:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:38,152 INFO L93 Difference]: Finished difference Result 310 states and 603 transitions. [2019-11-28 17:29:38,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 17:29:38,153 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 268 [2019-11-28 17:29:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:38,156 INFO L225 Difference]: With dead ends: 310 [2019-11-28 17:29:38,156 INFO L226 Difference]: Without dead ends: 165 [2019-11-28 17:29:38,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=1329, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 17:29:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-28 17:29:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 112. [2019-11-28 17:29:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 17:29:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2019-11-28 17:29:38,184 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 268 [2019-11-28 17:29:38,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:38,186 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2019-11-28 17:29:38,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 17:29:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2019-11-28 17:29:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-28 17:29:38,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:38,191 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:38,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:38,402 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:38,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1502984625, now seen corresponding path program 3 times [2019-11-28 17:29:38,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:38,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286081318] [2019-11-28 17:29:38,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 289 proven. 362 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-11-28 17:29:39,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286081318] [2019-11-28 17:29:39,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519171469] [2019-11-28 17:29:39,294 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:39,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 17:29:39,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:39,363 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 17:29:39,368 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 661 proven. 42 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2019-11-28 17:29:39,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:39,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13] total 34 [2019-11-28 17:29:39,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885196362] [2019-11-28 17:29:39,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-28 17:29:39,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:39,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-28 17:29:39,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 17:29:39,596 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand 34 states. [2019-11-28 17:29:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:40,484 INFO L93 Difference]: Finished difference Result 240 states and 403 transitions. [2019-11-28 17:29:40,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-28 17:29:40,485 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 214 [2019-11-28 17:29:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:40,488 INFO L225 Difference]: With dead ends: 240 [2019-11-28 17:29:40,488 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 17:29:40,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=1712, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 17:29:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 17:29:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2019-11-28 17:29:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 17:29:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 166 transitions. [2019-11-28 17:29:40,508 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 166 transitions. Word has length 214 [2019-11-28 17:29:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:40,508 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 166 transitions. [2019-11-28 17:29:40,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-28 17:29:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 166 transitions. [2019-11-28 17:29:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-28 17:29:40,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:40,513 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:40,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:40,718 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:40,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:40,719 INFO L82 PathProgramCache]: Analyzing trace with hash 634625338, now seen corresponding path program 4 times [2019-11-28 17:29:40,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:40,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660905208] [2019-11-28 17:29:40,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 131 proven. 3 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2019-11-28 17:29:40,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660905208] [2019-11-28 17:29:40,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618083810] [2019-11-28 17:29:40,929 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:41,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:29:41,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:41,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 17:29:41,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-11-28 17:29:41,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:29:41,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2019-11-28 17:29:41,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995573819] [2019-11-28 17:29:41,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:29:41,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:41,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:29:41,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:29:41,085 INFO L87 Difference]: Start difference. First operand 126 states and 166 transitions. Second operand 6 states. [2019-11-28 17:29:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:41,161 INFO L93 Difference]: Finished difference Result 240 states and 329 transitions. [2019-11-28 17:29:41,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:29:41,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-11-28 17:29:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:41,165 INFO L225 Difference]: With dead ends: 240 [2019-11-28 17:29:41,165 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 17:29:41,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:29:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 17:29:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-11-28 17:29:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-28 17:29:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2019-11-28 17:29:41,185 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 172 [2019-11-28 17:29:41,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:41,187 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2019-11-28 17:29:41,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:29:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2019-11-28 17:29:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-28 17:29:41,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:41,192 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:41,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:41,399 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:41,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:41,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1745059098, now seen corresponding path program 5 times [2019-11-28 17:29:41,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:41,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023523735] [2019-11-28 17:29:41,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 145 proven. 138 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-11-28 17:29:41,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023523735] [2019-11-28 17:29:41,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178211773] [2019-11-28 17:29:41,844 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:41,915 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-28 17:29:41,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:41,916 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 17:29:41,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 150 proven. 142 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-11-28 17:29:42,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:42,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2019-11-28 17:29:42,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171976638] [2019-11-28 17:29:42,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 17:29:42,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 17:29:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:29:42,030 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand 25 states. [2019-11-28 17:29:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:42,564 INFO L93 Difference]: Finished difference Result 244 states and 330 transitions. [2019-11-28 17:29:42,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 17:29:42,565 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 146 [2019-11-28 17:29:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:42,567 INFO L225 Difference]: With dead ends: 244 [2019-11-28 17:29:42,567 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 17:29:42,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2019-11-28 17:29:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 17:29:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-28 17:29:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 17:29:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 160 transitions. [2019-11-28 17:29:42,581 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 160 transitions. Word has length 146 [2019-11-28 17:29:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:42,582 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 160 transitions. [2019-11-28 17:29:42,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 17:29:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 160 transitions. [2019-11-28 17:29:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-28 17:29:42,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:42,588 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:42,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:42,792 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:42,793 INFO L82 PathProgramCache]: Analyzing trace with hash 245292255, now seen corresponding path program 6 times [2019-11-28 17:29:42,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:42,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184723599] [2019-11-28 17:29:42,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 210 proven. 368 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2019-11-28 17:29:43,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184723599] [2019-11-28 17:29:43,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141390687] [2019-11-28 17:29:43,496 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:43,617 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 17:29:43,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:43,620 INFO L264 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 17:29:43,627 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 294 proven. 58 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2019-11-28 17:29:43,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:43,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 30 [2019-11-28 17:29:43,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870651892] [2019-11-28 17:29:43,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 17:29:43,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 17:29:43,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2019-11-28 17:29:43,840 INFO L87 Difference]: Start difference. First operand 126 states and 160 transitions. Second operand 30 states. [2019-11-28 17:29:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:45,083 INFO L93 Difference]: Finished difference Result 281 states and 406 transitions. [2019-11-28 17:29:45,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-28 17:29:45,084 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 214 [2019-11-28 17:29:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:45,088 INFO L225 Difference]: With dead ends: 281 [2019-11-28 17:29:45,088 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 17:29:45,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=2192, Unknown=0, NotChecked=0, Total=2550 [2019-11-28 17:29:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 17:29:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-11-28 17:29:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-28 17:29:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 184 transitions. [2019-11-28 17:29:45,106 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 184 transitions. Word has length 214 [2019-11-28 17:29:45,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:45,107 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 184 transitions. [2019-11-28 17:29:45,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 17:29:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 184 transitions. [2019-11-28 17:29:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-28 17:29:45,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:45,110 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:45,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:45,316 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:45,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:45,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1112792143, now seen corresponding path program 7 times [2019-11-28 17:29:45,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:45,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999825214] [2019-11-28 17:29:45,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-11-28 17:29:46,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999825214] [2019-11-28 17:29:46,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378011516] [2019-11-28 17:29:46,538 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:46,622 INFO L264 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 103 conjunts are in the unsatisfiable core [2019-11-28 17:29:46,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-11-28 17:29:47,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:47,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 36 [2019-11-28 17:29:47,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488332926] [2019-11-28 17:29:47,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-28 17:29:47,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:47,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-28 17:29:47,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 17:29:47,337 INFO L87 Difference]: Start difference. First operand 143 states and 184 transitions. Second operand 36 states. [2019-11-28 17:29:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:47,833 INFO L93 Difference]: Finished difference Result 150 states and 193 transitions. [2019-11-28 17:29:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 17:29:47,834 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 173 [2019-11-28 17:29:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:47,836 INFO L225 Difference]: With dead ends: 150 [2019-11-28 17:29:47,836 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 17:29:47,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 227 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 17:29:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 17:29:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2019-11-28 17:29:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-28 17:29:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 182 transitions. [2019-11-28 17:29:47,857 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 182 transitions. Word has length 173 [2019-11-28 17:29:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:47,858 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 182 transitions. [2019-11-28 17:29:47,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-28 17:29:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 182 transitions. [2019-11-28 17:29:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-28 17:29:47,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:47,862 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:48,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:48,066 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:48,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1640173863, now seen corresponding path program 8 times [2019-11-28 17:29:48,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:48,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448581905] [2019-11-28 17:29:48,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 201 proven. 323 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2019-11-28 17:29:48,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448581905] [2019-11-28 17:29:48,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547428363] [2019-11-28 17:29:48,612 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:48,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:29:48,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:48,702 INFO L264 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 17:29:48,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 111 proven. 313 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2019-11-28 17:29:48,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:48,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 25 [2019-11-28 17:29:48,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643281469] [2019-11-28 17:29:48,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 17:29:48,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:48,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 17:29:48,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:29:48,889 INFO L87 Difference]: Start difference. First operand 143 states and 182 transitions. Second operand 25 states. [2019-11-28 17:29:49,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:49,426 INFO L93 Difference]: Finished difference Result 263 states and 336 transitions. [2019-11-28 17:29:49,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 17:29:49,426 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 214 [2019-11-28 17:29:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:49,428 INFO L225 Difference]: With dead ends: 263 [2019-11-28 17:29:49,428 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:29:49,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2019-11-28 17:29:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:29:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:29:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:29:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:29:49,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2019-11-28 17:29:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:49,433 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:29:49,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 17:29:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:29:49,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:29:49,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:49,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:29:50,294 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2019-11-28 17:29:50,816 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 30 [2019-11-28 17:29:51,320 WARN L192 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 25 [2019-11-28 17:29:51,324 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:29:51,324 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:29:51,324 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:29:51,325 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-28 17:29:51,325 INFO L242 CegarLoopResult]: At program point L41(lines 35 42) the Hoare annotation is: (<= 6 ULTIMATE.start_main_~x~0) [2019-11-28 17:29:51,325 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-28 17:29:51,325 INFO L246 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-11-28 17:29:51,325 INFO L242 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6)) [2019-11-28 17:29:51,326 INFO L246 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-11-28 17:29:51,326 INFO L246 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2019-11-28 17:29:51,326 INFO L249 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2019-11-28 17:29:51,326 INFO L242 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (not (<= |fibo2_#in~n| 1)) (= fibo2_~n |fibo2_#in~n|)) [2019-11-28 17:29:51,326 INFO L246 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-28 17:29:51,327 INFO L242 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (and (<= fibo2_~n 2) (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1) (<= 2 |fibo2_#in~n|)))) (and (or .cse0 (not (<= |fibo2_#in~n| 3))) (or (<= |fibo2_#in~n| 4) (<= 6 |fibo2_#in~n|) (and (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 3))) (= fibo2_~n |fibo2_#in~n|) (or .cse0 (<= 5 fibo2_~n) (and (<= |fibo2_#t~ret2| 2) (<= 2 |fibo2_#t~ret2|))))) [2019-11-28 17:29:51,327 INFO L246 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-11-28 17:29:51,327 INFO L246 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2019-11-28 17:29:51,327 INFO L246 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2019-11-28 17:29:51,327 INFO L246 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2019-11-28 17:29:51,328 INFO L246 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2019-11-28 17:29:51,328 INFO L249 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2019-11-28 17:29:51,328 INFO L242 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2019-11-28 17:29:51,328 INFO L246 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-11-28 17:29:51,328 INFO L242 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (or (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1)) (not (<= |fibo1_#in~n| 4))) (or (<= |fibo1_#in~n| 5) (<= 7 |fibo1_#in~n|) (and (<= |fibo1_#t~ret0| 5) (<= 5 |fibo1_#t~ret0|))) (= fibo1_~n |fibo1_#in~n|)) [2019-11-28 17:29:51,328 INFO L246 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2019-11-28 17:29:51,328 INFO L246 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2019-11-28 17:29:51,328 INFO L246 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-11-28 17:29:51,329 INFO L246 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2019-11-28 17:29:51,329 INFO L246 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2019-11-28 17:29:51,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:29:51 BoogieIcfgContainer [2019-11-28 17:29:51,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:29:51,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:29:51,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:29:51,344 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:29:51,345 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:28" (3/4) ... [2019-11-28 17:29:51,348 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:29:51,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2019-11-28 17:29:51,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2019-11-28 17:29:51,358 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 17:29:51,358 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 17:29:51,405 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:29:51,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:29:51,407 INFO L168 Benchmark]: Toolchain (without parser) took 23922.60 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 556.8 MB). Free memory was 952.3 MB in the beginning and 1.5 GB in the end (delta: -501.6 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:51,408 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:29:51,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.70 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:51,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:51,410 INFO L168 Benchmark]: Boogie Preprocessor took 17.30 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:51,410 INFO L168 Benchmark]: RCFGBuilder took 282.76 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: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:51,411 INFO L168 Benchmark]: TraceAbstraction took 23183.98 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 452.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -378.4 MB). Peak memory consumption was 678.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:51,411 INFO L168 Benchmark]: Witness Printer took 61.87 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:29:51,414 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.70 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.30 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 282.76 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: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23183.98 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 452.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -378.4 MB). Peak memory consumption was 678.4 MB. Max. memory is 11.5 GB. * Witness Printer took 61.87 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 6 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 21.3s, OverallIterations: 16, TraceHistogramMax: 21, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 485 SDtfs, 848 SDslu, 4710 SDs, 0 SdLazy, 6540 SolverSat, 886 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2648 GetRequests, 2269 SyntacticMatches, 19 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2714 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=14, 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, 16 MinimizatonAttempts, 155 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 701 PreInvPairs, 1173 NumberOfFragments, 124 HoareAnnotationTreeSize, 701 FomulaSimplifications, 9137 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 8 FomulaSimplificationsInter, 7447 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 3573 NumberOfCodeBlocks, 3402 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 3543 ConstructedInterpolants, 0 QuantifiedInterpolants, 1219797 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3572 ConjunctsInSsa, 237 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 13345/16956 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...