./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci03.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 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:24:08,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:24:08,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:24:08,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:24:08,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:24:08,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:24:08,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:24:08,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:24:08,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:24:08,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:24:08,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:24:08,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:24:08,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:24:08,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:24:08,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:24:08,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:24:08,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:24:08,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:24:08,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:24:08,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:24:08,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:24:08,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:24:08,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:24:08,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:24:08,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:24:08,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:24:08,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:24:08,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:24:08,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:24:08,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:24:08,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:24:08,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:24:08,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:24:08,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:24:08,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:24:08,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:24:08,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:24:08,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:24:08,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:24:08,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:24:08,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:24:08,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:24:08,175 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:24:08,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:24:08,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:24:08,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:24:08,178 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:24:08,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:24:08,179 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:24:08,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:24:08,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:24:08,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:24:08,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:24:08,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:24:08,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:24:08,182 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:24:08,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:24:08,183 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:24:08,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:24:08,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:24:08,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:24:08,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:24:08,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:24:08,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:24:08,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:24:08,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:24:08,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:24:08,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:24:08,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:24:08,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:24:08,186 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 -> 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 [2019-11-28 00:24:08,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:24:08,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:24:08,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:24:08,505 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:24:08,506 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:24:08,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci03.c [2019-11-28 00:24:08,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8666e19d1/02704bdfd7ee4c7eab0e85d65972e8c2/FLAG7a7a1b8d5 [2019-11-28 00:24:09,019 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:24:09,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci03.c [2019-11-28 00:24:09,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8666e19d1/02704bdfd7ee4c7eab0e85d65972e8c2/FLAG7a7a1b8d5 [2019-11-28 00:24:09,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8666e19d1/02704bdfd7ee4c7eab0e85d65972e8c2 [2019-11-28 00:24:09,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:24:09,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:24:09,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:09,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:24:09,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:24:09,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:09" (1/1) ... [2019-11-28 00:24:09,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21aba202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09, skipping insertion in model container [2019-11-28 00:24:09,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:09" (1/1) ... [2019-11-28 00:24:09,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:24:09,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:24:09,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:09,649 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:24:09,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:09,685 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:24:09,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09 WrapperNode [2019-11-28 00:24:09,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:09,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:09,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:24:09,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:24:09,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09" (1/1) ... [2019-11-28 00:24:09,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09" (1/1) ... [2019-11-28 00:24:09,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:09,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:24:09,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:24:09,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:24:09,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09" (1/1) ... [2019-11-28 00:24:09,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09" (1/1) ... [2019-11-28 00:24:09,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09" (1/1) ... [2019-11-28 00:24:09,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09" (1/1) ... [2019-11-28 00:24:09,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09" (1/1) ... [2019-11-28 00:24:09,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09" (1/1) ... [2019-11-28 00:24:09,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09" (1/1) ... [2019-11-28 00:24:09,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:24:09,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:24:09,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:24:09,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:24:09,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:24:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-28 00:24:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-28 00:24:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:24:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:24:10,045 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:24:10,045 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:24:10,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:10 BoogieIcfgContainer [2019-11-28 00:24:10,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:24:10,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:24:10,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:24:10,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:24:10,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:24:09" (1/3) ... [2019-11-28 00:24:10,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14beafb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:10, skipping insertion in model container [2019-11-28 00:24:10,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:09" (2/3) ... [2019-11-28 00:24:10,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14beafb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:10, skipping insertion in model container [2019-11-28 00:24:10,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:10" (3/3) ... [2019-11-28 00:24:10,056 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2019-11-28 00:24:10,066 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:24:10,074 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:24:10,093 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:24:10,128 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:24:10,128 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:24:10,128 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:24:10,128 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:24:10,128 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:24:10,129 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:24:10,129 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:24:10,129 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:24:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-28 00:24:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:24:10,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:10,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:10,159 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:10,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:10,166 INFO L82 PathProgramCache]: Analyzing trace with hash -337677157, now seen corresponding path program 1 times [2019-11-28 00:24:10,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:10,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841652883] [2019-11-28 00:24:10,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:24:10,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841652883] [2019-11-28 00:24:10,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:10,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:24:10,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549690910] [2019-11-28 00:24:10,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:24:10,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:10,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:24:10,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:24:10,423 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-11-28 00:24:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:10,599 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-11-28 00:24:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:24:10,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 00:24:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:10,617 INFO L225 Difference]: With dead ends: 31 [2019-11-28 00:24:10,618 INFO L226 Difference]: Without dead ends: 18 [2019-11-28 00:24:10,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 00:24:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-28 00:24:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 00:24:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 00:24:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-11-28 00:24:10,688 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2019-11-28 00:24:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:10,689 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-28 00:24:10,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:24:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-11-28 00:24:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 00:24:10,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:10,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:10,694 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:10,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1185838437, now seen corresponding path program 1 times [2019-11-28 00:24:10,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:10,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831200097] [2019-11-28 00:24:10,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:24:10,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831200097] [2019-11-28 00:24:10,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:10,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:24:10,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839230372] [2019-11-28 00:24:10,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:24:10,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:10,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:24:10,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:24:10,773 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2019-11-28 00:24:10,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:10,853 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-28 00:24:10,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:24:10,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 00:24:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:10,856 INFO L225 Difference]: With dead ends: 24 [2019-11-28 00:24:10,856 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 00:24:10,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 00:24:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 00:24:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-11-28 00:24:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 00:24:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-11-28 00:24:10,870 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2019-11-28 00:24:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:10,870 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-28 00:24:10,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:24:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-11-28 00:24:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:24:10,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:10,873 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:10,874 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:10,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash -461887010, now seen corresponding path program 1 times [2019-11-28 00:24:10,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:10,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923663293] [2019-11-28 00:24:10,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 00:24:11,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923663293] [2019-11-28 00:24:11,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4994302] [2019-11-28 00:24:11,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:24:11,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 00:24:11,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:11,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-28 00:24:11,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834880472] [2019-11-28 00:24:11,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 00:24:11,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:11,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 00:24:11,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:24:11,164 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2019-11-28 00:24:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:11,325 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-11-28 00:24:11,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:11,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-28 00:24:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:11,327 INFO L225 Difference]: With dead ends: 35 [2019-11-28 00:24:11,327 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 00:24:11,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:24:11,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 00:24:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 00:24:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 00:24:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-28 00:24:11,336 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2019-11-28 00:24:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:11,336 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-28 00:24:11,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 00:24:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-11-28 00:24:11,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:24:11,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:11,338 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:11,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:11,543 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:11,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:11,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1032875874, now seen corresponding path program 1 times [2019-11-28 00:24:11,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:11,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979929683] [2019-11-28 00:24:11,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:24:11,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979929683] [2019-11-28 00:24:11,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599075803] [2019-11-28 00:24:11,726 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 00:24:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:24:11,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:24:11,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:11,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-28 00:24:11,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341702473] [2019-11-28 00:24:11,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:24:11,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:11,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:24:11,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:24:11,797 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 8 states. [2019-11-28 00:24:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:11,927 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2019-11-28 00:24:11,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:11,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-28 00:24:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:11,930 INFO L225 Difference]: With dead ends: 38 [2019-11-28 00:24:11,930 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 00:24:11,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:24:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 00:24:11,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 00:24:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 00:24:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-11-28 00:24:11,943 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2019-11-28 00:24:11,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:11,943 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-11-28 00:24:11,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:24:11,944 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-11-28 00:24:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 00:24:11,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:11,946 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:12,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:12,157 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:12,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:12,158 INFO L82 PathProgramCache]: Analyzing trace with hash 498258551, now seen corresponding path program 2 times [2019-11-28 00:24:12,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:12,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405144794] [2019-11-28 00:24:12,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 00:24:12,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405144794] [2019-11-28 00:24:12,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630193183] [2019-11-28 00:24:12,369 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:12,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:24:12,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:12,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:24:12,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-28 00:24:12,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:12,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-28 00:24:12,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661252067] [2019-11-28 00:24:12,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:24:12,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:12,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:24:12,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:24:12,525 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 14 states. [2019-11-28 00:24:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:12,812 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2019-11-28 00:24:12,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:24:12,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-11-28 00:24:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:12,816 INFO L225 Difference]: With dead ends: 68 [2019-11-28 00:24:12,816 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:24:12,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:24:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:24:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 00:24:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 00:24:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-28 00:24:12,840 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2019-11-28 00:24:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:12,844 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-28 00:24:12,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:24:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-28 00:24:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-28 00:24:12,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:12,853 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:13,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:13,058 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2059564305, now seen corresponding path program 3 times [2019-11-28 00:24:13,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:13,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034102025] [2019-11-28 00:24:13,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-28 00:24:13,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034102025] [2019-11-28 00:24:13,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093524551] [2019-11-28 00:24:13,379 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:13,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 00:24:13,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:13,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:24:13,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-28 00:24:13,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:13,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-11-28 00:24:13,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223766841] [2019-11-28 00:24:13,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:24:13,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:13,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:24:13,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:24:13,459 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 12 states. [2019-11-28 00:24:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:13,636 INFO L93 Difference]: Finished difference Result 77 states and 108 transitions. [2019-11-28 00:24:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:24:13,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-11-28 00:24:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:13,640 INFO L225 Difference]: With dead ends: 77 [2019-11-28 00:24:13,641 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 00:24:13,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:24:13,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 00:24:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2019-11-28 00:24:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 00:24:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2019-11-28 00:24:13,659 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 65 [2019-11-28 00:24:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:13,660 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2019-11-28 00:24:13,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:24:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2019-11-28 00:24:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-28 00:24:13,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:13,663 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:13,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:13,868 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:13,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:13,870 INFO L82 PathProgramCache]: Analyzing trace with hash -270971525, now seen corresponding path program 4 times [2019-11-28 00:24:13,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:13,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541613647] [2019-11-28 00:24:13,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 309 proven. 340 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-11-28 00:24:14,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541613647] [2019-11-28 00:24:14,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247249785] [2019-11-28 00:24:14,511 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:14,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:24:14,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:14,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 00:24:14,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 222 proven. 397 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-11-28 00:24:14,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:14,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 23 [2019-11-28 00:24:14,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940419391] [2019-11-28 00:24:14,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 00:24:14,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:14,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 00:24:14,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-11-28 00:24:14,703 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand 23 states. [2019-11-28 00:24:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:15,156 INFO L93 Difference]: Finished difference Result 134 states and 224 transitions. [2019-11-28 00:24:15,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:24:15,157 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 147 [2019-11-28 00:24:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:15,163 INFO L225 Difference]: With dead ends: 134 [2019-11-28 00:24:15,163 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 00:24:15,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2019-11-28 00:24:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 00:24:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2019-11-28 00:24:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 00:24:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2019-11-28 00:24:15,182 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 147 [2019-11-28 00:24:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:15,183 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-11-28 00:24:15,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 00:24:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2019-11-28 00:24:15,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-28 00:24:15,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:15,190 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:15,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:15,394 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:15,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:15,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1624397958, now seen corresponding path program 5 times [2019-11-28 00:24:15,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:15,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793699201] [2019-11-28 00:24:15,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-28 00:24:15,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793699201] [2019-11-28 00:24:15,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575052297] [2019-11-28 00:24:15,655 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:15,726 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-11-28 00:24:15,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:15,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:24:15,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-28 00:24:15,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:15,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2019-11-28 00:24:15,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56242051] [2019-11-28 00:24:15,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:24:15,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:15,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:24:15,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:24:15,789 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand 14 states. [2019-11-28 00:24:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:16,010 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2019-11-28 00:24:16,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:24:16,011 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 106 [2019-11-28 00:24:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:16,014 INFO L225 Difference]: With dead ends: 64 [2019-11-28 00:24:16,014 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 00:24:16,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:24:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 00:24:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-28 00:24:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 00:24:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2019-11-28 00:24:16,026 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 106 [2019-11-28 00:24:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:16,026 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 77 transitions. [2019-11-28 00:24:16,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:24:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2019-11-28 00:24:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-28 00:24:16,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:16,030 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:16,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:16,234 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:16,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1761307917, now seen corresponding path program 6 times [2019-11-28 00:24:16,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:16,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616357288] [2019-11-28 00:24:16,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-11-28 00:24:16,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616357288] [2019-11-28 00:24:16,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822496252] [2019-11-28 00:24:16,714 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:16,820 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-11-28 00:24:16,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:16,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:24:16,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2019-11-28 00:24:16,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:16,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 16 [2019-11-28 00:24:16,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272388176] [2019-11-28 00:24:16,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 00:24:16,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:16,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 00:24:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:24:16,914 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand 16 states. [2019-11-28 00:24:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:17,122 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2019-11-28 00:24:17,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:24:17,123 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 174 [2019-11-28 00:24:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:17,127 INFO L225 Difference]: With dead ends: 178 [2019-11-28 00:24:17,127 INFO L226 Difference]: Without dead ends: 174 [2019-11-28 00:24:17,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:24:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-28 00:24:17,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 162. [2019-11-28 00:24:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-28 00:24:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 230 transitions. [2019-11-28 00:24:17,156 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 230 transitions. Word has length 174 [2019-11-28 00:24:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:17,157 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 230 transitions. [2019-11-28 00:24:17,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 00:24:17,157 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 230 transitions. [2019-11-28 00:24:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-11-28 00:24:17,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:17,165 INFO L410 BasicCegarLoop]: trace histogram [53, 53, 43, 26, 26, 26, 26, 26, 26, 26, 17, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:17,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:17,369 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:17,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash 26595927, now seen corresponding path program 7 times [2019-11-28 00:24:17,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:17,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936012947] [2019-11-28 00:24:17,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 1657 proven. 1717 refuted. 0 times theorem prover too weak. 4341 trivial. 0 not checked. [2019-11-28 00:24:18,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936012947] [2019-11-28 00:24:18,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460210195] [2019-11-28 00:24:18,781 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:18,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:24:18,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 219 proven. 1566 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2019-11-28 00:24:19,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:19,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 11] total 32 [2019-11-28 00:24:19,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578599988] [2019-11-28 00:24:19,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 00:24:19,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:19,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 00:24:19,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2019-11-28 00:24:19,041 INFO L87 Difference]: Start difference. First operand 162 states and 230 transitions. Second operand 32 states. [2019-11-28 00:24:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:19,831 INFO L93 Difference]: Finished difference Result 273 states and 458 transitions. [2019-11-28 00:24:19,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 00:24:19,832 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 365 [2019-11-28 00:24:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:19,834 INFO L225 Difference]: With dead ends: 273 [2019-11-28 00:24:19,835 INFO L226 Difference]: Without dead ends: 112 [2019-11-28 00:24:19,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=388, Invalid=1504, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 00:24:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-28 00:24:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2019-11-28 00:24:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 00:24:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2019-11-28 00:24:19,850 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 365 [2019-11-28 00:24:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:19,850 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2019-11-28 00:24:19,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 00:24:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2019-11-28 00:24:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-11-28 00:24:19,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:19,859 INFO L410 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:20,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:20,066 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:20,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1913424490, now seen corresponding path program 8 times [2019-11-28 00:24:20,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:20,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614618469] [2019-11-28 00:24:20,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2019-11-28 00:24:21,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614618469] [2019-11-28 00:24:21,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389145944] [2019-11-28 00:24:21,447 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:21,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:24:21,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:21,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 00:24:21,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2019-11-28 00:24:21,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:21,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 20 [2019-11-28 00:24:21,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286154825] [2019-11-28 00:24:21,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 00:24:21,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:21,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 00:24:21,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:24:21,804 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand 20 states. [2019-11-28 00:24:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:22,124 INFO L93 Difference]: Finished difference Result 333 states and 501 transitions. [2019-11-28 00:24:22,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:24:22,124 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 460 [2019-11-28 00:24:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:22,130 INFO L225 Difference]: With dead ends: 333 [2019-11-28 00:24:22,131 INFO L226 Difference]: Without dead ends: 329 [2019-11-28 00:24:22,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:24:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-28 00:24:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 311. [2019-11-28 00:24:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-11-28 00:24:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 463 transitions. [2019-11-28 00:24:22,170 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 463 transitions. Word has length 460 [2019-11-28 00:24:22,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:22,172 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 463 transitions. [2019-11-28 00:24:22,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 00:24:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 463 transitions. [2019-11-28 00:24:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2019-11-28 00:24:22,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:22,221 INFO L410 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:22,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:22,426 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:22,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:22,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1222363509, now seen corresponding path program 9 times [2019-11-28 00:24:22,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:22,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783932457] [2019-11-28 00:24:22,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-11-28 00:24:25,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783932457] [2019-11-28 00:24:25,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371006673] [2019-11-28 00:24:25,946 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:26,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-11-28 00:24:26,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:26,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 1660 conjuncts, 220 conjunts are in the unsatisfiable core [2019-11-28 00:24:26,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-11-28 00:24:27,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:27,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 36 [2019-11-28 00:24:27,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517993131] [2019-11-28 00:24:27,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-28 00:24:27,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:27,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-28 00:24:27,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 00:24:27,018 INFO L87 Difference]: Start difference. First operand 311 states and 463 transitions. Second operand 36 states. [2019-11-28 00:24:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:27,397 INFO L93 Difference]: Finished difference Result 394 states and 621 transitions. [2019-11-28 00:24:27,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-28 00:24:27,401 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 746 [2019-11-28 00:24:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:27,406 INFO L225 Difference]: With dead ends: 394 [2019-11-28 00:24:27,406 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:24:27,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1188 GetRequests, 1150 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1216, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 00:24:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:24:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:24:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:24:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:24:27,412 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 746 [2019-11-28 00:24:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:27,414 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:24:27,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-28 00:24:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:24:27,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:24:27,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:27,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:24:28,152 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 7 [2019-11-28 00:24:28,724 WARN L192 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 44 [2019-11-28 00:24:28,730 INFO L246 CegarLoopResult]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2019-11-28 00:24:28,731 INFO L249 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2019-11-28 00:24:28,731 INFO L242 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (not (<= |fibonacci_#in~n| 1)) (= fibonacci_~n |fibonacci_#in~n|)) [2019-11-28 00:24:28,731 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 00:24:28,731 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (let ((.cse1 (<= 1 |fibonacci_#t~ret0|)) (.cse0 (<= 7 fibonacci_~n))) (or (and (<= 4 fibonacci_~n) (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|)) (and (<= 8 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 7) .cse0) (and (< 1 fibonacci_~n) .cse1 (<= |fibonacci_#in~n| 2)) (and (<= fibonacci_~n 6) (<= 5 |fibonacci_#t~ret0|) (<= 6 fibonacci_~n)) (and .cse1 (<= fibonacci_~n 3) (<= 3 fibonacci_~n)) (and (<= 21 |fibonacci_#t~ret0|) .cse0) (and (<= 3 |fibonacci_#t~ret0|) (<= fibonacci_~n 5) (<= 5 fibonacci_~n)) (and (<= 13 |fibonacci_#t~ret0|) (<= fibonacci_~n 8) .cse0))) (= fibonacci_~n |fibonacci_#in~n|)) [2019-11-28 00:24:28,731 INFO L246 CegarLoopResult]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2019-11-28 00:24:28,732 INFO L246 CegarLoopResult]: For program point L17(lines 17 21) no Hoare annotation was computed. [2019-11-28 00:24:28,732 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-28 00:24:28,732 INFO L246 CegarLoopResult]: For program point L15(lines 15 21) no Hoare annotation was computed. [2019-11-28 00:24:28,732 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:24:28,732 INFO L246 CegarLoopResult]: For program point L31(lines 31 35) no Hoare annotation was computed. [2019-11-28 00:24:28,733 INFO L249 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2019-11-28 00:24:28,733 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:24:28,733 INFO L246 CegarLoopResult]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-11-28 00:24:28,733 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:24:28,733 INFO L246 CegarLoopResult]: For program point L27(lines 27 29) no Hoare annotation was computed. [2019-11-28 00:24:28,734 INFO L249 CegarLoopResult]: At program point L25(lines 25 36) the Hoare annotation is: true [2019-11-28 00:24:28,734 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) no Hoare annotation was computed. [2019-11-28 00:24:28,734 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-28 00:24:28,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:24:28 BoogieIcfgContainer [2019-11-28 00:24:28,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:24:28,743 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:24:28,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:24:28,744 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:24:28,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:10" (3/4) ... [2019-11-28 00:24:28,747 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:24:28,753 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2019-11-28 00:24:28,758 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:24:28,758 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:24:28,797 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:24:28,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:24:28,799 INFO L168 Benchmark]: Toolchain (without parser) took 19380.24 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 813.7 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -74.1 MB). Peak memory consumption was 739.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:28,800 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:28,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.26 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:28,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -206.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:28,804 INFO L168 Benchmark]: Boogie Preprocessor took 15.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:28,804 INFO L168 Benchmark]: RCFGBuilder took 248.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:28,805 INFO L168 Benchmark]: TraceAbstraction took 18694.68 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 656.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.6 MB). Peak memory consumption was 759.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:28,805 INFO L168 Benchmark]: Witness Printer took 54.01 ms. Allocated memory is still 1.8 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:28,809 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.26 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 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 96.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -206.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 248.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18694.68 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 656.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.6 MB). Peak memory consumption was 759.6 MB. Max. memory is 11.5 GB. * Witness Printer took 54.01 ms. Allocated memory is still 1.8 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: 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: 25]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Result: SAFE, OverallTime: 17.4s, OverallIterations: 12, TraceHistogramMax: 109, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 254 SDtfs, 548 SDslu, 1277 SDs, 0 SdLazy, 2283 SolverSat, 622 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3171 GetRequests, 2958 SyntacticMatches, 1 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 77 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 386 PreInvPairs, 658 NumberOfFragments, 93 HoareAnnotationTreeSize, 386 FomulaSimplifications, 723 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 5 FomulaSimplificationsInter, 5026 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 4315 NumberOfCodeBlocks, 4268 NumberOfCodeBlocksAsserted, 148 NumberOfCheckSat, 4293 ConstructedInterpolants, 0 QuantifiedInterpolants, 3728357 SizeOfPredicates, 50 NumberOfNonLiveVariables, 4681 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 93840/113678 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...