./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_20x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_20x0-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17db2a72807ac377d533a347dbb668103ea580a0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 18:58:21,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:58:21,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:58:21,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:58:21,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:58:21,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:58:21,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:58:21,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:58:21,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:58:21,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:58:21,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:58:21,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:58:21,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:58:21,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:58:21,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:58:21,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:58:21,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:58:21,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:58:21,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:58:21,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:58:21,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:58:21,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:58:21,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:58:21,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:58:21,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:58:21,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:58:21,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:58:21,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:58:21,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:58:21,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:58:21,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:58:21,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:58:21,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:58:21,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:58:21,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:58:21,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:58:21,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:58:21,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:58:21,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:58:21,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:58:21,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:58:21,983 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:58:22,021 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:58:22,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:58:22,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:58:22,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:58:22,024 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:58:22,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:58:22,025 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:58:22,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:58:22,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:58:22,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:58:22,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:58:22,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:58:22,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:58:22,028 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:58:22,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:58:22,028 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:58:22,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:58:22,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:58:22,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:58:22,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:58:22,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:58:22,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:58:22,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:58:22,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:58:22,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:58:22,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:58:22,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:58:22,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:58:22,031 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 -> 17db2a72807ac377d533a347dbb668103ea580a0 [2019-11-19 18:58:22,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:58:22,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:58:22,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:58:22,343 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:58:22,344 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:58:22,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2019-11-19 18:58:22,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/133ae5a8f/80b20c907ddd453885ff06076691eea0/FLAG67bab4cb5 [2019-11-19 18:58:22,943 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:58:22,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2019-11-19 18:58:22,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/133ae5a8f/80b20c907ddd453885ff06076691eea0/FLAG67bab4cb5 [2019-11-19 18:58:23,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/133ae5a8f/80b20c907ddd453885ff06076691eea0 [2019-11-19 18:58:23,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:58:23,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:58:23,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:58:23,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:58:23,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:58:23,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:58:23" (1/1) ... [2019-11-19 18:58:23,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297ac7ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23, skipping insertion in model container [2019-11-19 18:58:23,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:58:23" (1/1) ... [2019-11-19 18:58:23,376 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:58:23,399 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:58:23,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:58:23,558 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:58:23,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:58:23,592 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:58:23,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23 WrapperNode [2019-11-19 18:58:23,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:58:23,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:58:23,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:58:23,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:58:23,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23" (1/1) ... [2019-11-19 18:58:23,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23" (1/1) ... [2019-11-19 18:58:23,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:58:23,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:58:23,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:58:23,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:58:23,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23" (1/1) ... [2019-11-19 18:58:23,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23" (1/1) ... [2019-11-19 18:58:23,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23" (1/1) ... [2019-11-19 18:58:23,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23" (1/1) ... [2019-11-19 18:58:23,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23" (1/1) ... [2019-11-19 18:58:23,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23" (1/1) ... [2019-11-19 18:58:23,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23" (1/1) ... [2019-11-19 18:58:23,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:58:23,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:58:23,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:58:23,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:58:23,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23" (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-19 18:58:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:58:23,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:58:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-11-19 18:58:23,764 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-11-19 18:58:23,923 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:58:23,923 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 18:58:23,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:23 BoogieIcfgContainer [2019-11-19 18:58:23,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:58:23,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:58:23,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:58:23,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:58:23,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:58:23" (1/3) ... [2019-11-19 18:58:23,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc70756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:58:23, skipping insertion in model container [2019-11-19 18:58:23,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:58:23" (2/3) ... [2019-11-19 18:58:23,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc70756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:58:23, skipping insertion in model container [2019-11-19 18:58:23,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:23" (3/3) ... [2019-11-19 18:58:23,932 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2019-11-19 18:58:23,940 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:58:23,946 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:58:23,958 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:58:23,985 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:58:23,985 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:58:23,985 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:58:23,985 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:58:23,986 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:58:23,986 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:58:23,986 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:58:23,986 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:58:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-19 18:58:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 18:58:24,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:24,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:24,013 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:24,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-19 18:58:24,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:24,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134977359] [2019-11-19 18:58:24,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,301 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-19 18:58:24,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134977359] [2019-11-19 18:58:24,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:58:24,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 18:58:24,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985496158] [2019-11-19 18:58:24,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 18:58:24,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:24,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 18:58:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 18:58:24,330 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-19 18:58:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:24,494 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-19 18:58:24,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 18:58:24,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-19 18:58:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:24,509 INFO L225 Difference]: With dead ends: 24 [2019-11-19 18:58:24,509 INFO L226 Difference]: Without dead ends: 14 [2019-11-19 18:58:24,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 18:58:24,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-19 18:58:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-19 18:58:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-19 18:58:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-19 18:58:24,556 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-19 18:58:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:24,556 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-19 18:58:24,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 18:58:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-19 18:58:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 18:58:24,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:24,558 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:24,559 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:24,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:24,559 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-19 18:58:24,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:24,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865035569] [2019-11-19 18:58:24,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 18:58:24,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865035569] [2019-11-19 18:58:24,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161538477] [2019-11-19 18:58:24,747 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-19 18:58:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:24,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 18:58:24,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 18:58:24,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:24,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-19 18:58:24,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768024261] [2019-11-19 18:58:24,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 18:58:24,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:24,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 18:58:24,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 18:58:24,853 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2019-11-19 18:58:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:24,955 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-19 18:58:24,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:58:24,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-11-19 18:58:24,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:24,957 INFO L225 Difference]: With dead ends: 21 [2019-11-19 18:58:24,957 INFO L226 Difference]: Without dead ends: 17 [2019-11-19 18:58:24,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 18:58:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-19 18:58:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-19 18:58:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 18:58:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-19 18:58:24,964 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-19 18:58:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:24,964 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-19 18:58:24,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 18:58:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-19 18:58:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 18:58:24,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:24,966 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:25,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:25,167 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:25,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:25,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-19 18:58:25,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:25,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367848371] [2019-11-19 18:58:25,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 18:58:25,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367848371] [2019-11-19 18:58:25,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648752205] [2019-11-19 18:58:25,417 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:25,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 18:58:25,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:25,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 18:58:25,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 18:58:25,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:25,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-19 18:58:25,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617235413] [2019-11-19 18:58:25,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 18:58:25,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:25,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 18:58:25,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 18:58:25,492 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2019-11-19 18:58:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:25,600 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-19 18:58:25,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:58:25,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-19 18:58:25,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:25,602 INFO L225 Difference]: With dead ends: 24 [2019-11-19 18:58:25,602 INFO L226 Difference]: Without dead ends: 20 [2019-11-19 18:58:25,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-19 18:58:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-19 18:58:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-19 18:58:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 18:58:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-19 18:58:25,610 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-19 18:58:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:25,610 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-19 18:58:25,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 18:58:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-19 18:58:25,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 18:58:25,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:25,613 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:25,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:25,816 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:25,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:25,817 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-19 18:58:25,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:25,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363988693] [2019-11-19 18:58:25,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 18:58:26,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363988693] [2019-11-19 18:58:26,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484557695] [2019-11-19 18:58:26,039 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:26,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 18:58:26,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:26,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 18:58:26,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 18:58:26,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:26,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-11-19 18:58:26,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352704851] [2019-11-19 18:58:26,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 18:58:26,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:26,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 18:58:26,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-19 18:58:26,127 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-11-19 18:58:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:26,246 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-19 18:58:26,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 18:58:26,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-11-19 18:58:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:26,248 INFO L225 Difference]: With dead ends: 27 [2019-11-19 18:58:26,248 INFO L226 Difference]: Without dead ends: 23 [2019-11-19 18:58:26,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-19 18:58:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-19 18:58:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-19 18:58:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-19 18:58:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-19 18:58:26,264 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-19 18:58:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:26,267 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-19 18:58:26,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 18:58:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-19 18:58:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 18:58:26,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:26,272 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:26,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:26,477 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-19 18:58:26,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:26,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610382162] [2019-11-19 18:58:26,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 18:58:26,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610382162] [2019-11-19 18:58:26,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508388011] [2019-11-19 18:58:26,700 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:26,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 18:58:26,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:26,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 18:58:26,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 18:58:26,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:26,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-11-19 18:58:26,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824527877] [2019-11-19 18:58:26,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 18:58:26,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:26,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 18:58:26,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-19 18:58:26,800 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-11-19 18:58:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:26,921 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-19 18:58:26,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 18:58:26,922 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-19 18:58:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:26,923 INFO L225 Difference]: With dead ends: 30 [2019-11-19 18:58:26,923 INFO L226 Difference]: Without dead ends: 26 [2019-11-19 18:58:26,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-19 18:58:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-19 18:58:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-19 18:58:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 18:58:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-19 18:58:26,931 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-19 18:58:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:26,932 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-19 18:58:26,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 18:58:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-19 18:58:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 18:58:26,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:26,934 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:27,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:27,138 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:27,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-19 18:58:27,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:27,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657887056] [2019-11-19 18:58:27,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-19 18:58:27,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657887056] [2019-11-19 18:58:27,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617392914] [2019-11-19 18:58:27,378 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:27,420 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-19 18:58:27,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:27,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 18:58:27,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-19 18:58:27,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:27,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2019-11-19 18:58:27,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365296112] [2019-11-19 18:58:27,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 18:58:27,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:27,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 18:58:27,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-19 18:58:27,455 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2019-11-19 18:58:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:27,590 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-19 18:58:27,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 18:58:27,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-19 18:58:27,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:27,593 INFO L225 Difference]: With dead ends: 33 [2019-11-19 18:58:27,594 INFO L226 Difference]: Without dead ends: 29 [2019-11-19 18:58:27,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-19 18:58:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-19 18:58:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-19 18:58:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 18:58:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-19 18:58:27,602 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-19 18:58:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:27,603 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-19 18:58:27,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 18:58:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-19 18:58:27,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 18:58:27,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:27,605 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:27,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:27,815 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:27,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:27,816 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-19 18:58:27,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:27,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630206498] [2019-11-19 18:58:27,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-19 18:58:28,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630206498] [2019-11-19 18:58:28,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392556033] [2019-11-19 18:58:28,133 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:28,190 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-19 18:58:28,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:28,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 18:58:28,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-19 18:58:28,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:28,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-11-19 18:58:28,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574697469] [2019-11-19 18:58:28,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 18:58:28,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:28,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 18:58:28,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-19 18:58:28,236 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2019-11-19 18:58:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:28,378 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-19 18:58:28,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 18:58:28,379 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-11-19 18:58:28,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:28,380 INFO L225 Difference]: With dead ends: 36 [2019-11-19 18:58:28,380 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 18:58:28,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-11-19 18:58:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 18:58:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-19 18:58:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 18:58:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-19 18:58:28,396 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-19 18:58:28,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:28,396 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-19 18:58:28,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 18:58:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-19 18:58:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-19 18:58:28,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:28,403 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:28,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:28,609 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:28,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:28,610 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-19 18:58:28,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:28,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335121588] [2019-11-19 18:58:28,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-19 18:58:28,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335121588] [2019-11-19 18:58:28,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18760] [2019-11-19 18:58:28,869 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:28,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 18:58:28,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-19 18:58:28,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:28,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2019-11-19 18:58:28,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786860218] [2019-11-19 18:58:28,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 18:58:28,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 18:58:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-19 18:58:28,987 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 15 states. [2019-11-19 18:58:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:29,186 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-19 18:58:29,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 18:58:29,187 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-11-19 18:58:29,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:29,188 INFO L225 Difference]: With dead ends: 39 [2019-11-19 18:58:29,188 INFO L226 Difference]: Without dead ends: 35 [2019-11-19 18:58:29,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-11-19 18:58:29,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-19 18:58:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-19 18:58:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-19 18:58:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-19 18:58:29,201 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-19 18:58:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:29,202 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-19 18:58:29,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 18:58:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-19 18:58:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 18:58:29,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:29,206 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:29,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:29,420 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:29,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:29,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-19 18:58:29,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:29,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757526708] [2019-11-19 18:58:29,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-19 18:58:29,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757526708] [2019-11-19 18:58:29,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106271776] [2019-11-19 18:58:29,765 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:29,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 18:58:29,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:29,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-19 18:58:29,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-19 18:58:29,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:29,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 16 [2019-11-19 18:58:29,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717286832] [2019-11-19 18:58:29,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 18:58:29,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:29,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 18:58:29,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-19 18:58:29,876 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 16 states. [2019-11-19 18:58:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:30,018 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-19 18:58:30,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 18:58:30,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2019-11-19 18:58:30,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:30,021 INFO L225 Difference]: With dead ends: 42 [2019-11-19 18:58:30,021 INFO L226 Difference]: Without dead ends: 38 [2019-11-19 18:58:30,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2019-11-19 18:58:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-19 18:58:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-19 18:58:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-19 18:58:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-19 18:58:30,029 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-19 18:58:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:30,030 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-19 18:58:30,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 18:58:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-19 18:58:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 18:58:30,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:30,031 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:30,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:30,236 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-19 18:58:30,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:30,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784553292] [2019-11-19 18:58:30,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-19 18:58:30,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784553292] [2019-11-19 18:58:30,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379821798] [2019-11-19 18:58:30,581 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:30,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-19 18:58:30,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:30,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 18:58:30,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-19 18:58:30,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:30,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2019-11-19 18:58:30,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341595609] [2019-11-19 18:58:30,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 18:58:30,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:30,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 18:58:30,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-19 18:58:30,730 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 17 states. [2019-11-19 18:58:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:30,965 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-19 18:58:30,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 18:58:30,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2019-11-19 18:58:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:30,967 INFO L225 Difference]: With dead ends: 45 [2019-11-19 18:58:30,967 INFO L226 Difference]: Without dead ends: 41 [2019-11-19 18:58:30,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2019-11-19 18:58:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-19 18:58:30,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-19 18:58:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-19 18:58:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-19 18:58:30,976 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-19 18:58:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:30,976 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-19 18:58:30,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 18:58:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-19 18:58:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-19 18:58:30,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:30,978 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:31,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:31,191 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:31,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:31,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-19 18:58:31,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:31,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115813229] [2019-11-19 18:58:31,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-19 18:58:31,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115813229] [2019-11-19 18:58:31,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712762600] [2019-11-19 18:58:31,605 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:31,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 18:58:31,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:31,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-19 18:58:31,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-19 18:58:31,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:31,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2019-11-19 18:58:31,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058780165] [2019-11-19 18:58:31,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 18:58:31,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:31,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 18:58:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-11-19 18:58:31,716 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 18 states. [2019-11-19 18:58:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:31,885 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-19 18:58:31,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 18:58:31,886 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2019-11-19 18:58:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:31,887 INFO L225 Difference]: With dead ends: 48 [2019-11-19 18:58:31,888 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 18:58:31,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2019-11-19 18:58:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 18:58:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-19 18:58:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-19 18:58:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-19 18:58:31,895 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-19 18:58:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:31,896 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-19 18:58:31,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 18:58:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-19 18:58:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 18:58:31,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:31,897 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:32,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:32,109 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:32,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:32,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-19 18:58:32,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:32,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511273898] [2019-11-19 18:58:32,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-19 18:58:32,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511273898] [2019-11-19 18:58:32,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169441419] [2019-11-19 18:58:32,569 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:32,636 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-19 18:58:32,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:32,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-19 18:58:32,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-19 18:58:32,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:32,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 19 [2019-11-19 18:58:32,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421685352] [2019-11-19 18:58:32,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 18:58:32,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:32,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 18:58:32,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-11-19 18:58:32,690 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 19 states. [2019-11-19 18:58:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:32,893 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-19 18:58:32,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 18:58:32,894 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-11-19 18:58:32,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:32,895 INFO L225 Difference]: With dead ends: 51 [2019-11-19 18:58:32,895 INFO L226 Difference]: Without dead ends: 47 [2019-11-19 18:58:32,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=636, Unknown=0, NotChecked=0, Total=930 [2019-11-19 18:58:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-19 18:58:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-19 18:58:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 18:58:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-19 18:58:32,909 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-19 18:58:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:32,910 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-19 18:58:32,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 18:58:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-19 18:58:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 18:58:32,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:32,912 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:33,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:33,113 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:33,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:33,113 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-19 18:58:33,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:33,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632708501] [2019-11-19 18:58:33,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-19 18:58:33,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632708501] [2019-11-19 18:58:33,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620858862] [2019-11-19 18:58:33,600 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:33,720 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-19 18:58:33,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:33,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-19 18:58:33,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-19 18:58:33,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:33,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2019-11-19 18:58:33,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484647948] [2019-11-19 18:58:33,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-19 18:58:33,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:33,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-19 18:58:33,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-19 18:58:33,791 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 20 states. [2019-11-19 18:58:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:34,080 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-19 18:58:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 18:58:34,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2019-11-19 18:58:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:34,083 INFO L225 Difference]: With dead ends: 54 [2019-11-19 18:58:34,083 INFO L226 Difference]: Without dead ends: 50 [2019-11-19 18:58:34,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=337, Invalid=719, Unknown=0, NotChecked=0, Total=1056 [2019-11-19 18:58:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-19 18:58:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-19 18:58:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-19 18:58:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-19 18:58:34,100 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-19 18:58:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:34,101 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-19 18:58:34,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-19 18:58:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-19 18:58:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-19 18:58:34,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:34,103 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:34,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:34,307 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:34,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:34,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-19 18:58:34,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:34,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329396029] [2019-11-19 18:58:34,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-19 18:58:34,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329396029] [2019-11-19 18:58:34,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711305488] [2019-11-19 18:58:34,803 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:34,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-19 18:58:34,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-19 18:58:34,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:34,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 21 [2019-11-19 18:58:34,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712788440] [2019-11-19 18:58:34,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 18:58:34,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:34,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 18:58:34,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-11-19 18:58:34,909 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 21 states. [2019-11-19 18:58:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:35,136 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-19 18:58:35,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-19 18:58:35,136 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-11-19 18:58:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:35,137 INFO L225 Difference]: With dead ends: 57 [2019-11-19 18:58:35,137 INFO L226 Difference]: Without dead ends: 53 [2019-11-19 18:58:35,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=383, Invalid=807, Unknown=0, NotChecked=0, Total=1190 [2019-11-19 18:58:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-19 18:58:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-19 18:58:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-19 18:58:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-19 18:58:35,145 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-19 18:58:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:35,145 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-19 18:58:35,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 18:58:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-19 18:58:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-19 18:58:35,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:35,147 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:35,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:35,353 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-19 18:58:35,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:35,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132579617] [2019-11-19 18:58:35,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-19 18:58:35,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132579617] [2019-11-19 18:58:35,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976747454] [2019-11-19 18:58:35,989 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:36,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 18:58:36,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:36,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-19 18:58:36,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-19 18:58:36,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:36,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 22 [2019-11-19 18:58:36,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849578002] [2019-11-19 18:58:36,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 18:58:36,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:36,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 18:58:36,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-11-19 18:58:36,097 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 22 states. [2019-11-19 18:58:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:36,338 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-19 18:58:36,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 18:58:36,338 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2019-11-19 18:58:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:36,339 INFO L225 Difference]: With dead ends: 60 [2019-11-19 18:58:36,339 INFO L226 Difference]: Without dead ends: 56 [2019-11-19 18:58:36,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=900, Unknown=0, NotChecked=0, Total=1332 [2019-11-19 18:58:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-19 18:58:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-19 18:58:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-19 18:58:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-19 18:58:36,352 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-19 18:58:36,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:36,352 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-19 18:58:36,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 18:58:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-19 18:58:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 18:58:36,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:36,357 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:36,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:36,558 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:36,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-19 18:58:36,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:36,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460062177] [2019-11-19 18:58:36,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-19 18:58:37,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460062177] [2019-11-19 18:58:37,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900055560] [2019-11-19 18:58:37,141 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:37,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-19 18:58:37,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:37,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-19 18:58:37,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-19 18:58:37,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:37,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 23 [2019-11-19 18:58:37,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045141550] [2019-11-19 18:58:37,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-19 18:58:37,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:37,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-19 18:58:37,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-11-19 18:58:37,285 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 23 states. [2019-11-19 18:58:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:37,530 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-19 18:58:37,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-19 18:58:37,530 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2019-11-19 18:58:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:37,531 INFO L225 Difference]: With dead ends: 63 [2019-11-19 18:58:37,531 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 18:58:37,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=484, Invalid=998, Unknown=0, NotChecked=0, Total=1482 [2019-11-19 18:58:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 18:58:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-19 18:58:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-19 18:58:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-19 18:58:37,539 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-11-19 18:58:37,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:37,540 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-19 18:58:37,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-19 18:58:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-19 18:58:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 18:58:37,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:37,542 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:37,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:37,745 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-11-19 18:58:37,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:37,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737538301] [2019-11-19 18:58:37,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-19 18:58:38,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737538301] [2019-11-19 18:58:38,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449584827] [2019-11-19 18:58:38,530 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:38,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 18:58:38,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:38,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-19 18:58:38,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-19 18:58:38,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:38,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 24 [2019-11-19 18:58:38,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153985884] [2019-11-19 18:58:38,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-19 18:58:38,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:38,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-19 18:58:38,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-11-19 18:58:38,646 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 24 states. [2019-11-19 18:58:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:38,889 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-19 18:58:38,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 18:58:38,890 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 105 [2019-11-19 18:58:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:38,891 INFO L225 Difference]: With dead ends: 66 [2019-11-19 18:58:38,891 INFO L226 Difference]: Without dead ends: 62 [2019-11-19 18:58:38,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=539, Invalid=1101, Unknown=0, NotChecked=0, Total=1640 [2019-11-19 18:58:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-19 18:58:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-19 18:58:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-19 18:58:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-19 18:58:38,898 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-11-19 18:58:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:38,899 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-19 18:58:38,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-19 18:58:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-19 18:58:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-19 18:58:38,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:38,900 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:39,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:39,105 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:39,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-11-19 18:58:39,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:39,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576383940] [2019-11-19 18:58:39,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-19 18:58:39,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576383940] [2019-11-19 18:58:39,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871980000] [2019-11-19 18:58:39,792 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:39,872 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-19 18:58:39,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:39,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-19 18:58:39,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-19 18:58:39,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:39,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 25 [2019-11-19 18:58:39,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612716254] [2019-11-19 18:58:39,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-19 18:58:39,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:39,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 18:58:39,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-11-19 18:58:39,933 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 25 states. [2019-11-19 18:58:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:40,244 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-11-19 18:58:40,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 18:58:40,244 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 111 [2019-11-19 18:58:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:40,246 INFO L225 Difference]: With dead ends: 69 [2019-11-19 18:58:40,246 INFO L226 Difference]: Without dead ends: 65 [2019-11-19 18:58:40,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=597, Invalid=1209, Unknown=0, NotChecked=0, Total=1806 [2019-11-19 18:58:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-19 18:58:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-19 18:58:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-19 18:58:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-19 18:58:40,253 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-11-19 18:58:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:40,254 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-19 18:58:40,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-19 18:58:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-19 18:58:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-19 18:58:40,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:40,256 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:40,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:40,461 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:40,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:40,462 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-11-19 18:58:40,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:40,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078895129] [2019-11-19 18:58:40,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-19 18:58:41,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078895129] [2019-11-19 18:58:41,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922168783] [2019-11-19 18:58:41,247 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:41,328 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-11-19 18:58:41,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 18:58:41,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-19 18:58:41,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-19 18:58:41,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:41,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 26 [2019-11-19 18:58:41,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108730755] [2019-11-19 18:58:41,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-19 18:58:41,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:41,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-19 18:58:41,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2019-11-19 18:58:41,396 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 26 states. [2019-11-19 18:58:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:41,711 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-11-19 18:58:41,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-19 18:58:41,712 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2019-11-19 18:58:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:41,713 INFO L225 Difference]: With dead ends: 72 [2019-11-19 18:58:41,713 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 18:58:41,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=658, Invalid=1322, Unknown=0, NotChecked=0, Total=1980 [2019-11-19 18:58:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 18:58:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-19 18:58:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 18:58:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-19 18:58:41,719 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-11-19 18:58:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:41,720 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-19 18:58:41,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-19 18:58:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-19 18:58:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-19 18:58:41,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:41,722 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:41,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:41,928 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:41,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:41,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-11-19 18:58:41,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:41,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986388578] [2019-11-19 18:58:41,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-19 18:58:42,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986388578] [2019-11-19 18:58:42,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211123436] [2019-11-19 18:58:42,825 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:58:42,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-19 18:58:42,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:58:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-19 18:58:42,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 18:58:42,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 27 [2019-11-19 18:58:42,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719894221] [2019-11-19 18:58:42,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-19 18:58:42,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:58:42,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-19 18:58:42,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2019-11-19 18:58:42,962 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 27 states. [2019-11-19 18:58:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:58:43,277 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-11-19 18:58:43,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-19 18:58:43,277 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2019-11-19 18:58:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:58:43,278 INFO L225 Difference]: With dead ends: 75 [2019-11-19 18:58:43,278 INFO L226 Difference]: Without dead ends: 71 [2019-11-19 18:58:43,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=722, Invalid=1440, Unknown=0, NotChecked=0, Total=2162 [2019-11-19 18:58:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-19 18:58:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-19 18:58:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 18:58:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-19 18:58:43,288 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-11-19 18:58:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:58:43,288 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-19 18:58:43,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-19 18:58:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-19 18:58:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-19 18:58:43,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:58:43,290 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:58:43,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 18:58:43,494 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:58:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:58:43,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-11-19 18:58:43,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:58:43,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538751717] [2019-11-19 18:58:43,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:58:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:58:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:58:43,568 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:58:43,569 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:58:43,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:58:43 BoogieIcfgContainer [2019-11-19 18:58:43,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:58:43,666 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:58:43,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:58:43,668 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:58:43,669 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:58:23" (3/4) ... [2019-11-19 18:58:43,672 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 18:58:43,761 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:58:43,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:58:43,764 INFO L168 Benchmark]: Toolchain (without parser) took 20404.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 473.4 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -255.3 MB). Peak memory consumption was 218.2 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:43,764 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:58:43,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.74 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:43,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.58 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:58:43,766 INFO L168 Benchmark]: Boogie Preprocessor took 70.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:43,766 INFO L168 Benchmark]: RCFGBuilder took 228.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:43,767 INFO L168 Benchmark]: TraceAbstraction took 19739.95 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 333.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -92.6 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. [2019-11-19 18:58:43,767 INFO L168 Benchmark]: Witness Printer took 95.34 ms. Allocated memory is still 1.5 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-19 18:58:43,769 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.74 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.58 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19739.95 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 333.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -92.6 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. * Witness Printer took 95.34 ms. Allocated memory is still 1.5 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: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 20; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=20, \old(n)=0, \result=20, m=20, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1, m=19, n=1, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2, m=18, n=2, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3, m=17, n=3, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4, m=16, n=4, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5, m=15, n=5, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6, m=14, n=6, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7, m=13, n=7, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8, m=12, n=8, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9, m=11, n=9, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10, m=10, n=10, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11, m=9, n=11, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12, m=8, n=12, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13, m=7, n=13, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14, m=6, n=14, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15, m=5, n=15, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16, m=4, n=16, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17, m=3, n=17, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18, m=2, n=18, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19, m=1, n=19, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=20, m=0, n=20, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Result: UNSAFE, OverallTime: 19.6s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 162 SDtfs, 730 SDslu, 984 SDs, 0 SdLazy, 1203 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2212 GetRequests, 1693 SyntacticMatches, 0 SemanticMatches, 519 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 2760 NumberOfCodeBlocks, 2760 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 2592 ConstructedInterpolants, 0 QuantifiedInterpolants, 579952 SizeOfPredicates, 228 NumberOfNonLiveVariables, 3971 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 39 InterpolantComputations, 1 PerfectInterpolantSequences, 7600/15200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...