./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann03.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/Ackermann03.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 33d0641b9a339cc7e30dea71c1d04be4d72dcf57 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:23:58,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:23:58,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:23:58,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:23:58,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:23:58,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:23:58,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:23:58,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:23:58,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:23:58,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:23:58,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:23:58,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:23:58,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:23:58,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:23:58,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:23:58,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:23:58,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:23:58,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:23:58,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:23:58,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:23:58,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:23:58,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:23:58,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:23:58,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:23:58,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:23:58,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:23:58,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:23:58,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:23:58,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:23:58,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:23:58,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:23:58,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:23:58,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:23:58,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:23:58,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:23:58,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:23:58,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:23:58,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:23:58,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:23:58,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:23:58,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:23:58,720 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:23:58,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:23:58,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:23:58,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:23:58,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:23:58,743 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:23:58,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:23:58,743 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:23:58,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:23:58,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:23:58,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:23:58,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:23:58,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:23:58,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:23:58,746 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:23:58,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:23:58,747 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:23:58,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:23:58,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:23:58,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:23:58,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:23:58,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:23:58,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:23:58,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:23:58,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:23:58,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:23:58,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:23:58,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:23:58,750 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:23:58,750 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 -> 33d0641b9a339cc7e30dea71c1d04be4d72dcf57 [2019-11-28 00:23:59,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:23:59,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:23:59,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:23:59,170 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:23:59,171 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:23:59,172 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann03.c [2019-11-28 00:23:59,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9db06b2/c147556d46e847258543e41a0fef5578/FLAGe8f484535 [2019-11-28 00:23:59,671 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:23:59,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c [2019-11-28 00:23:59,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9db06b2/c147556d46e847258543e41a0fef5578/FLAGe8f484535 [2019-11-28 00:24:00,061 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9db06b2/c147556d46e847258543e41a0fef5578 [2019-11-28 00:24:00,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:24:00,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:24:00,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:00,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:24:00,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:24:00,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:00" (1/1) ... [2019-11-28 00:24:00,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3463e911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:00, skipping insertion in model container [2019-11-28 00:24:00,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:00" (1/1) ... [2019-11-28 00:24:00,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:24:00,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:24:00,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:00,354 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:24:00,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:00,384 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:24:00,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:00 WrapperNode [2019-11-28 00:24:00,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:00,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:00,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:24:00,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:24:00,396 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:00" (1/1) ... [2019-11-28 00:24:00,404 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:00" (1/1) ... [2019-11-28 00:24:00,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:00,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:24:00,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:24:00,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:24:00,499 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:00" (1/1) ... [2019-11-28 00:24:00,500 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:00" (1/1) ... [2019-11-28 00:24:00,501 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:00" (1/1) ... [2019-11-28 00:24:00,501 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:00" (1/1) ... [2019-11-28 00:24:00,504 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:00" (1/1) ... [2019-11-28 00:24:00,507 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:00" (1/1) ... [2019-11-28 00:24:00,510 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:00" (1/1) ... [2019-11-28 00:24:00,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:24:00,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:24:00,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:24:00,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:24:00,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:00" (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:00,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:24:00,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:24:00,583 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-11-28 00:24:00,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-11-28 00:24:00,807 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:24:00,808 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:24:00,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:00 BoogieIcfgContainer [2019-11-28 00:24:00,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:24:00,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:24:00,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:24:00,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:24:00,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:24:00" (1/3) ... [2019-11-28 00:24:00,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ceab4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:00, skipping insertion in model container [2019-11-28 00:24:00,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:00" (2/3) ... [2019-11-28 00:24:00,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ceab4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:00, skipping insertion in model container [2019-11-28 00:24:00,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:00" (3/3) ... [2019-11-28 00:24:00,845 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2019-11-28 00:24:00,870 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:24:00,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:24:00,908 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:24:00,931 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:24:00,932 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:24:00,932 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:24:00,932 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:24:00,932 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:24:00,933 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:24:00,933 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:24:00,933 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:24:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-11-28 00:24:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 00:24:00,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:00,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:00,957 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:00,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1260755674, now seen corresponding path program 1 times [2019-11-28 00:24:00,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:00,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339558060] [2019-11-28 00:24:00,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,199 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:01,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339558060] [2019-11-28 00:24:01,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:01,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:24:01,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110266411] [2019-11-28 00:24:01,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:24:01,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:24:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:24:01,222 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2019-11-28 00:24:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:01,390 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2019-11-28 00:24:01,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:24:01,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 00:24:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:01,403 INFO L225 Difference]: With dead ends: 50 [2019-11-28 00:24:01,403 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 00:24:01,407 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:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 00:24:01,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 00:24:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 00:24:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-11-28 00:24:01,452 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2019-11-28 00:24:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:01,452 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-28 00:24:01,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:24:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-11-28 00:24:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:24:01,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:01,455 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:01,456 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:01,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:01,456 INFO L82 PathProgramCache]: Analyzing trace with hash 963920485, now seen corresponding path program 1 times [2019-11-28 00:24:01,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:01,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461464237] [2019-11-28 00:24:01,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:24:01,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461464237] [2019-11-28 00:24:01,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997659736] [2019-11-28 00:24:01,648 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:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:01,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 00:24:01,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:24:01,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:01,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-11-28 00:24:01,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912495770] [2019-11-28 00:24:01,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 00:24:01,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:01,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 00:24:01,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:24:01,802 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 11 states. [2019-11-28 00:24:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:02,064 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2019-11-28 00:24:02,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:24:02,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-28 00:24:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:02,068 INFO L225 Difference]: With dead ends: 53 [2019-11-28 00:24:02,068 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 00:24:02,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:24:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 00:24:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-28 00:24:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:24:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-28 00:24:02,087 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2019-11-28 00:24:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:02,087 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 00:24:02,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 00:24:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2019-11-28 00:24:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:24:02,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:02,092 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:02,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:02,299 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:02,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:02,299 INFO L82 PathProgramCache]: Analyzing trace with hash 416247163, now seen corresponding path program 1 times [2019-11-28 00:24:02,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:02,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61554633] [2019-11-28 00:24:02,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 00:24:02,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61554633] [2019-11-28 00:24:02,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688363637] [2019-11-28 00:24:02,614 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:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:02,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:24:02,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 00:24:02,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:02,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-11-28 00:24:02,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081416955] [2019-11-28 00:24:02,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:24:02,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:02,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:24:02,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:24:02,766 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 14 states. [2019-11-28 00:24:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:03,357 INFO L93 Difference]: Finished difference Result 83 states and 166 transitions. [2019-11-28 00:24:03,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:24:03,358 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-28 00:24:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:03,363 INFO L225 Difference]: With dead ends: 83 [2019-11-28 00:24:03,363 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 00:24:03,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-11-28 00:24:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 00:24:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2019-11-28 00:24:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 00:24:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2019-11-28 00:24:03,407 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 31 [2019-11-28 00:24:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:03,408 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2019-11-28 00:24:03,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:24:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2019-11-28 00:24:03,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 00:24:03,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:03,420 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:03,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:03,625 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:03,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:03,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1827824897, now seen corresponding path program 2 times [2019-11-28 00:24:03,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:03,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257810044] [2019-11-28 00:24:03,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-28 00:24:03,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257810044] [2019-11-28 00:24:03,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681857262] [2019-11-28 00:24:03,908 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:03,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:24:03,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:03,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:24:03,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-28 00:24:04,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:04,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-28 00:24:04,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118026408] [2019-11-28 00:24:04,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 00:24:04,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:04,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 00:24:04,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:24:04,006 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand 9 states. [2019-11-28 00:24:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:04,144 INFO L93 Difference]: Finished difference Result 119 states and 226 transitions. [2019-11-28 00:24:04,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:24:04,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-11-28 00:24:04,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:04,147 INFO L225 Difference]: With dead ends: 119 [2019-11-28 00:24:04,147 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 00:24:04,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:24:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 00:24:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-28 00:24:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 00:24:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2019-11-28 00:24:04,162 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 44 [2019-11-28 00:24:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:04,162 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-11-28 00:24:04,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 00:24:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2019-11-28 00:24:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 00:24:04,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:04,166 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:04,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:04,370 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:04,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1207723706, now seen corresponding path program 3 times [2019-11-28 00:24:04,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:04,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122289355] [2019-11-28 00:24:04,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 00:24:04,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122289355] [2019-11-28 00:24:04,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505326652] [2019-11-28 00:24:04,806 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:04,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 00:24:04,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:04,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 00:24:04,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 98 proven. 19 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-28 00:24:04,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:04,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 18 [2019-11-28 00:24:04,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589207496] [2019-11-28 00:24:04,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 00:24:04,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:04,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 00:24:04,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:24:04,949 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand 18 states. [2019-11-28 00:24:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:05,503 INFO L93 Difference]: Finished difference Result 118 states and 221 transitions. [2019-11-28 00:24:05,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 00:24:05,504 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-11-28 00:24:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:05,511 INFO L225 Difference]: With dead ends: 118 [2019-11-28 00:24:05,516 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 00:24:05,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 00:24:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 00:24:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-28 00:24:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 00:24:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2019-11-28 00:24:05,546 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 78 [2019-11-28 00:24:05,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:05,547 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-11-28 00:24:05,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 00:24:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2019-11-28 00:24:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-28 00:24:05,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:05,556 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 14, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:05,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:05,760 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash -554167378, now seen corresponding path program 4 times [2019-11-28 00:24:05,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:05,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868404080] [2019-11-28 00:24:05,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 364 proven. 420 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2019-11-28 00:24:06,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868404080] [2019-11-28 00:24:06,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248886067] [2019-11-28 00:24:06,535 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:06,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:24:06,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:06,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:24:06,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 374 proven. 140 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2019-11-28 00:24:06,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:06,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8] total 28 [2019-11-28 00:24:06,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073137477] [2019-11-28 00:24:06,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 00:24:06,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 00:24:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2019-11-28 00:24:06,870 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 28 states. [2019-11-28 00:24:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:10,464 INFO L93 Difference]: Finished difference Result 176 states and 446 transitions. [2019-11-28 00:24:10,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-11-28 00:24:10,469 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 157 [2019-11-28 00:24:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:10,472 INFO L225 Difference]: With dead ends: 176 [2019-11-28 00:24:10,472 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 00:24:10,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2280 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1700, Invalid=7420, Unknown=0, NotChecked=0, Total=9120 [2019-11-28 00:24:10,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 00:24:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-11-28 00:24:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 00:24:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-11-28 00:24:10,488 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 157 [2019-11-28 00:24:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:10,488 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-11-28 00:24:10,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 00:24:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-11-28 00:24:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-28 00:24:10,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:10,490 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:10,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:10,702 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:10,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:10,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1646083662, now seen corresponding path program 5 times [2019-11-28 00:24:10,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:10,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189886128] [2019-11-28 00:24:10,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 240 proven. 264 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-11-28 00:24:11,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189886128] [2019-11-28 00:24:11,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343943372] [2019-11-28 00:24:11,370 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:11,440 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-28 00:24:11,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:11,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 00:24:11,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-11-28 00:24:11,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:11,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 19 [2019-11-28 00:24:11,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034813706] [2019-11-28 00:24:11,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 00:24:11,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:11,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 00:24:11,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:24:11,530 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 19 states. [2019-11-28 00:24:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:12,189 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-11-28 00:24:12,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 00:24:12,190 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2019-11-28 00:24:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:12,193 INFO L225 Difference]: With dead ends: 121 [2019-11-28 00:24:12,193 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 00:24:12,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=1528, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 00:24:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 00:24:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-11-28 00:24:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 00:24:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2019-11-28 00:24:12,205 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 130 [2019-11-28 00:24:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:12,206 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-11-28 00:24:12,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 00:24:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2019-11-28 00:24:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 00:24:12,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:12,208 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:12,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:12,412 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:12,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:12,413 INFO L82 PathProgramCache]: Analyzing trace with hash -437561620, now seen corresponding path program 6 times [2019-11-28 00:24:12,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:12,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149591015] [2019-11-28 00:24:12,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 446 proven. 274 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-11-28 00:24:12,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149591015] [2019-11-28 00:24:12,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981316265] [2019-11-28 00:24:12,924 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:13,059 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-11-28 00:24:13,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:13,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 00:24:13,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2019-11-28 00:24:13,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:13,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 24 [2019-11-28 00:24:13,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30819630] [2019-11-28 00:24:13,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 00:24:13,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:13,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 00:24:13,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:24:13,144 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 24 states. [2019-11-28 00:24:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:14,057 INFO L93 Difference]: Finished difference Result 133 states and 167 transitions. [2019-11-28 00:24:14,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-28 00:24:14,058 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 156 [2019-11-28 00:24:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:14,060 INFO L225 Difference]: With dead ends: 133 [2019-11-28 00:24:14,060 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 00:24:14,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=500, Invalid=2470, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 00:24:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 00:24:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2019-11-28 00:24:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 00:24:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2019-11-28 00:24:14,087 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 156 [2019-11-28 00:24:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:14,090 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2019-11-28 00:24:14,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 00:24:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2019-11-28 00:24:14,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-28 00:24:14,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:14,092 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:14,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:14,298 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:14,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:14,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1768194034, now seen corresponding path program 7 times [2019-11-28 00:24:14,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:14,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172233097] [2019-11-28 00:24:14,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 503 proven. 360 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2019-11-28 00:24:14,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172233097] [2019-11-28 00:24:14,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881121006] [2019-11-28 00:24:14,888 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:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-28 00:24:14,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-11-28 00:24:15,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:15,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 25 [2019-11-28 00:24:15,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304661993] [2019-11-28 00:24:15,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 00:24:15,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:15,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 00:24:15,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:24:15,077 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand 25 states. [2019-11-28 00:24:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:16,164 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2019-11-28 00:24:16,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-28 00:24:16,164 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 169 [2019-11-28 00:24:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:16,167 INFO L225 Difference]: With dead ends: 151 [2019-11-28 00:24:16,167 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 00:24:16,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=619, Invalid=3041, Unknown=0, NotChecked=0, Total=3660 [2019-11-28 00:24:16,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 00:24:16,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 78. [2019-11-28 00:24:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 00:24:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2019-11-28 00:24:16,182 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 169 [2019-11-28 00:24:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:16,183 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2019-11-28 00:24:16,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 00:24:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2019-11-28 00:24:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-28 00:24:16,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:16,186 INFO L410 BasicCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:16,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:16,391 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:16,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:16,392 INFO L82 PathProgramCache]: Analyzing trace with hash -728546296, now seen corresponding path program 8 times [2019-11-28 00:24:16,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:16,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722800454] [2019-11-28 00:24:16,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,589 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,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,609 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,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2019-11-28 00:24:17,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722800454] [2019-11-28 00:24:17,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160575259] [2019-11-28 00:24:17,240 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:17,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:24:17,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:17,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-28 00:24:17,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2019-11-28 00:24:17,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:17,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 25 [2019-11-28 00:24:17,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921979917] [2019-11-28 00:24:17,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 00:24:17,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:17,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 00:24:17,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:24:17,611 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 25 states. [2019-11-28 00:24:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:19,353 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-11-28 00:24:19,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-28 00:24:19,354 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 182 [2019-11-28 00:24:19,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:19,356 INFO L225 Difference]: With dead ends: 125 [2019-11-28 00:24:19,356 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 00:24:19,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 234 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=247, Invalid=2615, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 00:24:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 00:24:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2019-11-28 00:24:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 00:24:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2019-11-28 00:24:19,371 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 182 [2019-11-28 00:24:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:19,372 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2019-11-28 00:24:19,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 00:24:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2019-11-28 00:24:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-28 00:24:19,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:19,375 INFO L410 BasicCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:19,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:19,579 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:19,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:19,579 INFO L82 PathProgramCache]: Analyzing trace with hash -215902222, now seen corresponding path program 9 times [2019-11-28 00:24:19,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:19,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374155672] [2019-11-28 00:24:19,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 665 proven. 517 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2019-11-28 00:24:20,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374155672] [2019-11-28 00:24:20,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457797298] [2019-11-28 00:24:20,419 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:20,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-11-28 00:24:20,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:20,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-28 00:24:20,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2019-11-28 00:24:20,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:20,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 27 [2019-11-28 00:24:20,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408472060] [2019-11-28 00:24:20,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 00:24:20,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:20,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 00:24:20,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-11-28 00:24:20,664 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand 27 states. [2019-11-28 00:24:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:21,610 INFO L93 Difference]: Finished difference Result 206 states and 269 transitions. [2019-11-28 00:24:21,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 00:24:21,611 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 195 [2019-11-28 00:24:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:21,614 INFO L225 Difference]: With dead ends: 206 [2019-11-28 00:24:21,615 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 00:24:21,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=439, Invalid=2213, Unknown=0, NotChecked=0, Total=2652 [2019-11-28 00:24:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 00:24:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2019-11-28 00:24:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 00:24:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2019-11-28 00:24:21,636 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 195 [2019-11-28 00:24:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:21,636 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2019-11-28 00:24:21,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 00:24:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2019-11-28 00:24:21,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-28 00:24:21,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:21,642 INFO L410 BasicCegarLoop]: trace histogram [31, 31, 17, 14, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:21,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:21,858 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:21,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1299313862, now seen corresponding path program 10 times [2019-11-28 00:24:21,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:21,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385240820] [2019-11-28 00:24:21,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 268 proven. 783 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2019-11-28 00:24:22,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385240820] [2019-11-28 00:24:22,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291740542] [2019-11-28 00:24:22,749 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:22,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:24:22,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:22,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 00:24:22,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 1340 proven. 196 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-11-28 00:24:23,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:23,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 20 [2019-11-28 00:24:23,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330577010] [2019-11-28 00:24:23,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 00:24:23,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:23,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 00:24:23,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:24:23,009 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand 20 states. [2019-11-28 00:24:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:23,529 INFO L93 Difference]: Finished difference Result 174 states and 226 transitions. [2019-11-28 00:24:23,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 00:24:23,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 208 [2019-11-28 00:24:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:23,532 INFO L225 Difference]: With dead ends: 174 [2019-11-28 00:24:23,532 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 00:24:23,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 00:24:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 00:24:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2019-11-28 00:24:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-28 00:24:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2019-11-28 00:24:23,544 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 208 [2019-11-28 00:24:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:23,545 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2019-11-28 00:24:23,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 00:24:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2019-11-28 00:24:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-28 00:24:23,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:23,551 INFO L410 BasicCegarLoop]: trace histogram [42, 42, 23, 19, 18, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:23,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:23,756 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:23,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash -261718049, now seen corresponding path program 11 times [2019-11-28 00:24:23,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:23,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302352788] [2019-11-28 00:24:23,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,092 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,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,498 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,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1521 proven. 761 refuted. 0 times theorem prover too weak. 2047 trivial. 0 not checked. [2019-11-28 00:24:25,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302352788] [2019-11-28 00:24:25,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234713152] [2019-11-28 00:24:25,016 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:25,185 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-11-28 00:24:25,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:25,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-28 00:24:25,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1483 proven. 777 refuted. 0 times theorem prover too weak. 2069 trivial. 0 not checked. [2019-11-28 00:24:25,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:25,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 34 [2019-11-28 00:24:25,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708157850] [2019-11-28 00:24:25,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-28 00:24:25,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:25,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-28 00:24:25,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 00:24:25,339 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand 34 states. [2019-11-28 00:24:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:27,284 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2019-11-28 00:24:27,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-11-28 00:24:27,285 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 280 [2019-11-28 00:24:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:27,287 INFO L225 Difference]: With dead ends: 191 [2019-11-28 00:24:27,288 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 00:24:27,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1037, Invalid=5935, Unknown=0, NotChecked=0, Total=6972 [2019-11-28 00:24:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 00:24:27,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2019-11-28 00:24:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 00:24:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2019-11-28 00:24:27,308 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 280 [2019-11-28 00:24:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:27,309 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2019-11-28 00:24:27,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-28 00:24:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2019-11-28 00:24:27,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-11-28 00:24:27,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:27,312 INFO L410 BasicCegarLoop]: trace histogram [44, 44, 24, 20, 19, 19, 19, 19, 19, 19, 19, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:27,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:27,518 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:27,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1710761897, now seen corresponding path program 12 times [2019-11-28 00:24:27,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:27,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669152533] [2019-11-28 00:24:27,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 233 proven. 548 refuted. 0 times theorem prover too weak. 3983 trivial. 0 not checked. [2019-11-28 00:24:28,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669152533] [2019-11-28 00:24:28,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813192242] [2019-11-28 00:24:28,293 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:28,508 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-11-28 00:24:28,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:28,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 00:24:28,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 215 proven. 426 refuted. 0 times theorem prover too weak. 4123 trivial. 0 not checked. [2019-11-28 00:24:28,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:28,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-28 00:24:28,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613146034] [2019-11-28 00:24:28,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:24:28,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:28,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:24:28,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:24:28,655 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 12 states. [2019-11-28 00:24:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:28,870 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2019-11-28 00:24:28,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:24:28,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 293 [2019-11-28 00:24:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:28,872 INFO L225 Difference]: With dead ends: 97 [2019-11-28 00:24:28,872 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:24:28,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:24:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:24:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:24:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:24:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:24:28,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 293 [2019-11-28 00:24:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:28,877 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:24:28,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:24:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:24:28,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:24:29,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:29,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:24:29,694 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 70 [2019-11-28 00:24:30,564 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 20 [2019-11-28 00:24:32,324 WARN L192 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 177 DAG size of output: 74 [2019-11-28 00:24:32,441 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 9 [2019-11-28 00:24:32,497 INFO L246 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-11-28 00:24:32,498 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:24:32,498 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:24:32,498 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:24:32,498 INFO L246 CegarLoopResult]: For program point L27(lines 27 31) no Hoare annotation was computed. [2019-11-28 00:24:32,498 INFO L249 CegarLoopResult]: At program point L25(lines 25 45) the Hoare annotation is: true [2019-11-28 00:24:32,498 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-11-28 00:24:32,498 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-28 00:24:32,498 INFO L246 CegarLoopResult]: For program point L40(lines 40 44) no Hoare annotation was computed. [2019-11-28 00:24:32,499 INFO L249 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2019-11-28 00:24:32,499 INFO L246 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2019-11-28 00:24:32,499 INFO L246 CegarLoopResult]: For program point ackermannEXIT(lines 14 22) no Hoare annotation was computed. [2019-11-28 00:24:32,499 INFO L249 CegarLoopResult]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2019-11-28 00:24:32,499 INFO L242 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= |ackermann_#in~n| 0)) (or (not (<= 0 |ackermann_#in~m|)) (not (<= 1 |ackermann_#in~n|)) (<= 1 |ackermann_#in~m|) (not (<= |ackermann_#in~n| 1)))) [2019-11-28 00:24:32,499 INFO L246 CegarLoopResult]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-11-28 00:24:32,499 INFO L242 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2019-11-28 00:24:32,500 INFO L242 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse12 (<= 3 |ackermann_#t~ret1|)) (.cse10 (= ackermann_~m |ackermann_#in~m|)) (.cse13 (= |ackermann_#in~n| 1)) (.cse11 (= ackermann_~n |ackermann_#in~n|)) (.cse9 (<= 2 |ackermann_#in~m|))) (let ((.cse6 (<= |ackermann_#t~ret1| 5)) (.cse3 (<= |ackermann_#t~ret1| 3)) (.cse0 (<= 3 |ackermann_#in~n|)) (.cse4 (<= 5 |ackermann_#t~ret1|)) (.cse5 (<= |ackermann_#in~n| 2)) (.cse8 (not (<= 1 |ackermann_#in~m|))) (.cse1 (<= 7 |ackermann_#t~ret1|)) (.cse14 (and .cse12 .cse10 (or (<= 2 |ackermann_#res|) (not .cse13)) .cse11 .cse9)) (.cse2 (<= |ackermann_#in~n| 1)) (.cse7 (<= ackermann_~m 1)) (.cse15 (= |ackermann_#in~m| 0))) (and (or (and .cse0 .cse1) (<= 3 |ackermann_#in~m|) (and .cse2 .cse3) (and (<= 2 |ackermann_#in~n|) .cse4 .cse5 .cse6) .cse7) (or (and .cse6 (<= 4 |ackermann_#in~n|)) .cse8 .cse9 .cse3 (and .cse0 (<= |ackermann_#t~ret1| 4)) (<= 5 |ackermann_#in~n|)) (or (and .cse10 .cse11 (<= |ackermann_#t~ret1| 6) (<= 6 |ackermann_#t~ret1|)) .cse8 (and .cse4 .cse10 .cse11 (<= |ackermann_#in~n| 4)) (and .cse12 .cse5 .cse10 .cse11) (and (<= 4 |ackermann_#t~ret1|) .cse10 (<= |ackermann_#in~n| 3) .cse11) .cse13 (and .cse10 .cse11 (<= 6 |ackermann_#in~n|)) .cse14) (or (<= |ackermann_#in~n| 5) .cse8 .cse1 .cse14) (or .cse15 (and .cse12 .cse10 .cse11 .cse9) (not .cse2) (and .cse10 .cse11 .cse7 (<= 2 |ackermann_#t~ret1|) (<= |ackermann_#t~ret1| 2))) (or .cse15 (not (<= |ackermann_#in~n| 0))) (or (not (<= |ackermann_#in~m| 0)) (and .cse10 .cse15 .cse11))))) [2019-11-28 00:24:32,500 INFO L246 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2019-11-28 00:24:32,500 INFO L246 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-11-28 00:24:32,500 INFO L246 CegarLoopResult]: For program point L21-3(line 21) no Hoare annotation was computed. [2019-11-28 00:24:32,500 INFO L246 CegarLoopResult]: For program point L15(lines 15 17) no Hoare annotation was computed. [2019-11-28 00:24:32,500 INFO L246 CegarLoopResult]: For program point ackermannFINAL(lines 14 22) no Hoare annotation was computed. [2019-11-28 00:24:32,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:24:32 BoogieIcfgContainer [2019-11-28 00:24:32,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:24:32,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:24:32,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:24:32,514 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:24:32,515 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:00" (3/4) ... [2019-11-28 00:24:32,519 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:24:32,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2019-11-28 00:24:32,537 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:24:32,538 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 00:24:32,625 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:24:32,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:24:32,627 INFO L168 Benchmark]: Toolchain (without parser) took 32560.32 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 634.4 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -249.6 MB). Peak memory consumption was 384.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:32,628 INFO L168 Benchmark]: CDTParser took 0.21 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:32,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.63 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:32,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:32,629 INFO L168 Benchmark]: Boogie Preprocessor took 22.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:32,630 INFO L168 Benchmark]: RCFGBuilder took 298.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:32,630 INFO L168 Benchmark]: TraceAbstraction took 31701.00 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 534.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.4 MB). Peak memory consumption was 741.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:32,631 INFO L168 Benchmark]: Witness Printer took 111.95 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 00:24:32,633 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.21 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 315.63 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 298.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31701.00 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 534.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.4 MB). Peak memory consumption was 741.1 MB. Max. memory is 11.5 GB. * Witness Printer took 111.95 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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, 22 locations, 1 error locations. Result: SAFE, OverallTime: 28.1s, OverallIterations: 14, TraceHistogramMax: 44, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, HoareTripleCheckerStatistics: 365 SDtfs, 574 SDslu, 2235 SDs, 0 SdLazy, 7727 SolverSat, 1447 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3112 GetRequests, 2540 SyntacticMatches, 7 SemanticMatches, 565 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred 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, 14 MinimizatonAttempts, 179 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 538 PreInvPairs, 1158 NumberOfFragments, 286 HoareAnnotationTreeSize, 538 FomulaSimplifications, 258652 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 20970 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 3893 NumberOfCodeBlocks, 3758 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 3866 ConstructedInterpolants, 0 QuantifiedInterpolants, 1389250 SizeOfPredicates, 111 NumberOfNonLiveVariables, 5351 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 27 InterpolantComputations, 1 PerfectInterpolantSequences, 33464/40688 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...