./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 76e89a58b9c6f7059fcf416ee7a1666558a3d440 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:19:44,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:19:44,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:19:44,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:19:44,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:19:44,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:19:44,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:19:44,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:19:44,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:19:44,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:19:44,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:19:44,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:19:44,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:19:44,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:19:44,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:19:44,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:19:44,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:19:44,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:19:44,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:19:44,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:19:44,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:19:44,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:19:44,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:19:44,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:19:44,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:19:44,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:19:44,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:19:44,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:19:44,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:19:44,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:19:44,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:19:44,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:19:44,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:19:44,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:19:44,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:19:44,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:19:44,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:19:44,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:19:44,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:19:44,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:19:44,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:19:44,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-28 20:19:44,753 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:19:44,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:19:44,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:19:44,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:19:44,758 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:19:44,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:19:44,759 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:19:44,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:19:44,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:19:44,760 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:19:44,761 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:19:44,761 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:19:44,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:19:44,762 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:19:44,763 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:19:44,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:19:44,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:19:44,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:19:44,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:19:44,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:19:44,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:19:44,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:19:44,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:19:44,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:19:44,766 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:19:44,767 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e89a58b9c6f7059fcf416ee7a1666558a3d440 [2019-11-28 20:19:45,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:19:45,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:19:45,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:19:45,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:19:45,128 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:19:45,129 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2019-11-28 20:19:45,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cd2d60c/14aa40a63351475085ecd5ffecc847a3/FLAGbd64a09b7 [2019-11-28 20:19:45,625 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:19:45,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2019-11-28 20:19:45,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cd2d60c/14aa40a63351475085ecd5ffecc847a3/FLAGbd64a09b7 [2019-11-28 20:19:46,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cd2d60c/14aa40a63351475085ecd5ffecc847a3 [2019-11-28 20:19:46,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:19:46,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:19:46,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:46,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:19:46,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:19:46,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:46" (1/1) ... [2019-11-28 20:19:46,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402edb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:46, skipping insertion in model container [2019-11-28 20:19:46,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:46" (1/1) ... [2019-11-28 20:19:46,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:19:46,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:19:46,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:46,277 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:19:46,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:46,310 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:19:46,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:46 WrapperNode [2019-11-28 20:19:46,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:46,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:19:46,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:19:46,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:19:46,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:46" (1/1) ... [2019-11-28 20:19:46,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:46" (1/1) ... [2019-11-28 20:19:46,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:46" (1/1) ... [2019-11-28 20:19:46,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:46" (1/1) ... [2019-11-28 20:19:46,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:46" (1/1) ... [2019-11-28 20:19:46,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:46" (1/1) ... [2019-11-28 20:19:46,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:46" (1/1) ... [2019-11-28 20:19:46,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:19:46,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:19:46,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:19:46,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:19:46,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:19:46,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:19:46,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:19:46,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:19:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:19:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:19:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:19:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:19:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:19:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:19:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:19:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:19:46,739 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:19:46,739 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-28 20:19:46,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:46 BoogieIcfgContainer [2019-11-28 20:19:46,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:19:46,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:19:46,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:19:46,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:19:46,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:19:46" (1/3) ... [2019-11-28 20:19:46,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c0d91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:46, skipping insertion in model container [2019-11-28 20:19:46,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:46" (2/3) ... [2019-11-28 20:19:46,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c0d91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:46, skipping insertion in model container [2019-11-28 20:19:46,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:46" (3/3) ... [2019-11-28 20:19:46,758 INFO L109 eAbstractionObserver]: Analyzing ICFG NonTermination3-1.c [2019-11-28 20:19:46,767 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:19:46,776 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-28 20:19:46,787 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-28 20:19:46,807 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:19:46,808 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:19:46,808 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:19:46,808 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:19:46,809 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:19:46,809 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:19:46,809 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:19:46,809 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:19:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 20:19:46,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:46,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:46,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:46,831 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:46,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1254763092, now seen corresponding path program 1 times [2019-11-28 20:19:46,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:46,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995103574] [2019-11-28 20:19:46,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:47,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995103574] [2019-11-28 20:19:47,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:47,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:47,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213327815] [2019-11-28 20:19:47,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:47,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:47,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:47,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:47,124 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 4 states. [2019-11-28 20:19:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:47,261 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-28 20:19:47,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:47,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:47,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:47,273 INFO L225 Difference]: With dead ends: 33 [2019-11-28 20:19:47,273 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 20:19:47,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 20:19:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-11-28 20:19:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:19:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-28 20:19:47,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 8 [2019-11-28 20:19:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:47,316 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-28 20:19:47,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-28 20:19:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:47,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:47,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:47,317 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:47,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:47,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1254763091, now seen corresponding path program 1 times [2019-11-28 20:19:47,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:47,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619246820] [2019-11-28 20:19:47,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:47,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619246820] [2019-11-28 20:19:47,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:47,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:47,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6049798] [2019-11-28 20:19:47,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:47,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:47,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:47,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:47,415 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-11-28 20:19:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:47,472 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-11-28 20:19:47,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:47,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:47,473 INFO L225 Difference]: With dead ends: 24 [2019-11-28 20:19:47,474 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 20:19:47,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 20:19:47,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 20:19:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 20:19:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-28 20:19:47,480 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 8 [2019-11-28 20:19:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:47,480 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-28 20:19:47,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-28 20:19:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:19:47,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:47,481 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:47,482 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:47,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:47,482 INFO L82 PathProgramCache]: Analyzing trace with hash 707835031, now seen corresponding path program 1 times [2019-11-28 20:19:47,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:47,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908631256] [2019-11-28 20:19:47,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:47,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908631256] [2019-11-28 20:19:47,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532123302] [2019-11-28 20:19:47,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:47,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:19:47,681 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:47,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:19:47,751 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:47,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:47,760 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:47,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 20:19:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:47,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:47,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-11-28 20:19:47,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947239010] [2019-11-28 20:19:47,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:19:47,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:47,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:19:47,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:19:47,781 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-11-28 20:19:47,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:47,882 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-28 20:19:47,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:19:47,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 20:19:47,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:47,884 INFO L225 Difference]: With dead ends: 30 [2019-11-28 20:19:47,884 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 20:19:47,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:19:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 20:19:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-28 20:19:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 20:19:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-28 20:19:47,890 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 12 [2019-11-28 20:19:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:47,890 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-28 20:19:47,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:19:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-28 20:19:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:19:47,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:47,892 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:48,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:48,093 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2098043558, now seen corresponding path program 2 times [2019-11-28 20:19:48,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:48,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508914490] [2019-11-28 20:19:48,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:48,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508914490] [2019-11-28 20:19:48,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967259513] [2019-11-28 20:19:48,238 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-28 20:19:48,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:19:48,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:48,281 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:19:48,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:48,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:19:48,291 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:48,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:48,299 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:48,300 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 20:19:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:48,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:19:48,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-11-28 20:19:48,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178826951] [2019-11-28 20:19:48,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:19:48,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:48,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:19:48,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:19:48,382 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2019-11-28 20:19:48,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:48,434 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-11-28 20:19:48,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:19:48,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 20:19:48,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:48,436 INFO L225 Difference]: With dead ends: 29 [2019-11-28 20:19:48,436 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 20:19:48,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:19:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 20:19:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-28 20:19:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 20:19:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-28 20:19:48,441 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2019-11-28 20:19:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:48,442 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-28 20:19:48,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:19:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-28 20:19:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:19:48,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:48,443 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:48,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:48,647 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:48,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:48,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1880246455, now seen corresponding path program 1 times [2019-11-28 20:19:48,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:48,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648929708] [2019-11-28 20:19:48,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:48,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648929708] [2019-11-28 20:19:48,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605304992] [2019-11-28 20:19:48,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:48,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:19:48,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:48,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:48,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 20:19:48,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370298461] [2019-11-28 20:19:48,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:19:48,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:48,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:19:48,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:48,797 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2019-11-28 20:19:48,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:48,876 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-28 20:19:48,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:19:48,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-28 20:19:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:48,878 INFO L225 Difference]: With dead ends: 33 [2019-11-28 20:19:48,878 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 20:19:48,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:48,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 20:19:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-11-28 20:19:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 20:19:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-28 20:19:48,891 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2019-11-28 20:19:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:48,896 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-28 20:19:48,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:19:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-28 20:19:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:19:48,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:48,900 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:49,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:49,106 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:49,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:49,106 INFO L82 PathProgramCache]: Analyzing trace with hash 671779276, now seen corresponding path program 2 times [2019-11-28 20:19:49,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:49,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349651580] [2019-11-28 20:19:49,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:49,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349651580] [2019-11-28 20:19:49,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676346191] [2019-11-28 20:19:49,193 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:49,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:19:49,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:49,238 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:19:49,240 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:49,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:19:49,253 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:49,258 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:49,259 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:49,259 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 20:19:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 20:19:49,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:19:49,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-11-28 20:19:49,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638767591] [2019-11-28 20:19:49,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:19:49,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:49,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:19:49,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:19:49,339 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 5 states. [2019-11-28 20:19:49,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:49,435 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-11-28 20:19:49,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:19:49,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 20:19:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:49,436 INFO L225 Difference]: With dead ends: 33 [2019-11-28 20:19:49,437 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 20:19:49,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 20:19:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-28 20:19:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 20:19:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-28 20:19:49,442 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2019-11-28 20:19:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:49,442 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-28 20:19:49,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:19:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-11-28 20:19:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:19:49,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:49,443 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:49,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:49,645 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:49,646 INFO L82 PathProgramCache]: Analyzing trace with hash -649672835, now seen corresponding path program 1 times [2019-11-28 20:19:49,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:49,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38707911] [2019-11-28 20:19:49,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 20:19:49,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38707911] [2019-11-28 20:19:49,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:49,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:19:49,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444530315] [2019-11-28 20:19:49,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:49,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:49,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:49,744 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2019-11-28 20:19:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:49,794 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-11-28 20:19:49,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:49,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-28 20:19:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:49,796 INFO L225 Difference]: With dead ends: 32 [2019-11-28 20:19:49,796 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 20:19:49,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 20:19:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-28 20:19:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 20:19:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-11-28 20:19:49,810 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2019-11-28 20:19:49,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:49,810 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-11-28 20:19:49,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-11-28 20:19:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:19:49,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:49,813 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:49,813 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:49,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1334976847, now seen corresponding path program 1 times [2019-11-28 20:19:49,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:49,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989342384] [2019-11-28 20:19:49,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:49,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989342384] [2019-11-28 20:19:49,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235159428] [2019-11-28 20:19:49,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:49,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:19:49,937 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:49,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:49,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-28 20:19:49,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219996205] [2019-11-28 20:19:49,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:19:49,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:49,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:19:49,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:19:49,954 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2019-11-28 20:19:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:50,017 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-28 20:19:50,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:19:50,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-28 20:19:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:50,023 INFO L225 Difference]: With dead ends: 39 [2019-11-28 20:19:50,023 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 20:19:50,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:19:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 20:19:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-28 20:19:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 20:19:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-28 20:19:50,030 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 24 [2019-11-28 20:19:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:50,030 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-28 20:19:50,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:19:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-28 20:19:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:19:50,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:50,033 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:50,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:50,234 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:50,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1360643474, now seen corresponding path program 2 times [2019-11-28 20:19:50,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:50,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708125464] [2019-11-28 20:19:50,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:50,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708125464] [2019-11-28 20:19:50,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054429457] [2019-11-28 20:19:50,331 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:19:50,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:19:50,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:50,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:19:50,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-28 20:19:50,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:19:50,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2019-11-28 20:19:50,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970474369] [2019-11-28 20:19:50,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:19:50,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:19:50,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:50,443 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2019-11-28 20:19:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:50,476 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-11-28 20:19:50,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:19:50,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 20:19:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:50,478 INFO L225 Difference]: With dead ends: 35 [2019-11-28 20:19:50,480 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 20:19:50,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 20:19:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-28 20:19:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 20:19:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-11-28 20:19:50,484 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2019-11-28 20:19:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:50,485 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-11-28 20:19:50,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:19:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-11-28 20:19:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 20:19:50,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:50,488 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:50,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:50,695 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:50,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:50,696 INFO L82 PathProgramCache]: Analyzing trace with hash -775549161, now seen corresponding path program 1 times [2019-11-28 20:19:50,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:50,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164223738] [2019-11-28 20:19:50,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:50,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164223738] [2019-11-28 20:19:50,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295819890] [2019-11-28 20:19:50,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:50,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:19:50,828 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:50,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:50,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-28 20:19:50,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708726347] [2019-11-28 20:19:50,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:19:50,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:50,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:19:50,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:50,854 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 9 states. [2019-11-28 20:19:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:50,919 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-11-28 20:19:50,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:19:50,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-28 20:19:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:50,920 INFO L225 Difference]: With dead ends: 37 [2019-11-28 20:19:50,921 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 20:19:50,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 20:19:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-11-28 20:19:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 20:19:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-11-28 20:19:50,928 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2019-11-28 20:19:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:50,929 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-11-28 20:19:50,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:19:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-11-28 20:19:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 20:19:50,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:50,934 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:51,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:51,144 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:51,145 INFO L82 PathProgramCache]: Analyzing trace with hash -105276236, now seen corresponding path program 2 times [2019-11-28 20:19:51,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:51,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565851692] [2019-11-28 20:19:51,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:51,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565851692] [2019-11-28 20:19:51,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223362430] [2019-11-28 20:19:51,238 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:51,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:19:51,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:51,304 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:19:51,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:51,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:51,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-28 20:19:51,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403496242] [2019-11-28 20:19:51,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:19:51,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:51,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:19:51,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:19:51,333 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 10 states. [2019-11-28 20:19:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:51,408 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-11-28 20:19:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:19:51,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-11-28 20:19:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:51,410 INFO L225 Difference]: With dead ends: 41 [2019-11-28 20:19:51,410 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 20:19:51,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:19:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 20:19:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-11-28 20:19:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:19:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 20:19:51,415 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2019-11-28 20:19:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:51,415 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 20:19:51,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:19:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 20:19:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 20:19:51,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:51,416 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:51,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:51,621 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:51,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1144843311, now seen corresponding path program 3 times [2019-11-28 20:19:51,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:51,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802441537] [2019-11-28 20:19:51,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:51,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802441537] [2019-11-28 20:19:51,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857426498] [2019-11-28 20:19:51,735 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:51,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-28 20:19:51,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:51,787 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:19:51,789 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:51,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:51,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-28 20:19:51,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113608623] [2019-11-28 20:19:51,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:19:51,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:51,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:19:51,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:51,806 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 11 states. [2019-11-28 20:19:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:51,882 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-28 20:19:51,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:19:51,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-11-28 20:19:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:51,883 INFO L225 Difference]: With dead ends: 45 [2019-11-28 20:19:51,883 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 20:19:51,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 20:19:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-11-28 20:19:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 20:19:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-11-28 20:19:51,887 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 37 [2019-11-28 20:19:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:51,888 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-28 20:19:51,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:19:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-11-28 20:19:51,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 20:19:51,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:51,889 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:52,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:52,098 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:52,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:52,098 INFO L82 PathProgramCache]: Analyzing trace with hash -539904914, now seen corresponding path program 4 times [2019-11-28 20:19:52,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:52,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745272895] [2019-11-28 20:19:52,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:52,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745272895] [2019-11-28 20:19:52,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694366466] [2019-11-28 20:19:52,190 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:52,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:19:52,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:52,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:19:52,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:52,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:52,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-11-28 20:19:52,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967647702] [2019-11-28 20:19:52,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:19:52,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:52,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:19:52,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:19:52,290 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 12 states. [2019-11-28 20:19:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:52,357 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-11-28 20:19:52,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:19:52,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-11-28 20:19:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:52,358 INFO L225 Difference]: With dead ends: 49 [2019-11-28 20:19:52,359 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 20:19:52,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:19:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 20:19:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-11-28 20:19:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 20:19:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-11-28 20:19:52,363 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2019-11-28 20:19:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:52,364 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-11-28 20:19:52,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:19:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-11-28 20:19:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 20:19:52,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:52,365 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:52,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:52,569 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:52,569 INFO L82 PathProgramCache]: Analyzing trace with hash 607436427, now seen corresponding path program 5 times [2019-11-28 20:19:52,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:52,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673184964] [2019-11-28 20:19:52,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:52,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673184964] [2019-11-28 20:19:52,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081041689] [2019-11-28 20:19:52,676 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:52,726 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-28 20:19:52,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:52,728 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:19:52,730 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:52,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:52,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-28 20:19:52,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012441737] [2019-11-28 20:19:52,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:19:52,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:52,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:19:52,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:19:52,766 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 13 states. [2019-11-28 20:19:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:52,836 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-11-28 20:19:52,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:19:52,836 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-11-28 20:19:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:52,837 INFO L225 Difference]: With dead ends: 53 [2019-11-28 20:19:52,837 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 20:19:52,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:19:52,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 20:19:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-11-28 20:19:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:19:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 20:19:52,841 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2019-11-28 20:19:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:52,841 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 20:19:52,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:19:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 20:19:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 20:19:52,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:52,847 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:53,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:53,056 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash 228291112, now seen corresponding path program 6 times [2019-11-28 20:19:53,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:53,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033502098] [2019-11-28 20:19:53,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:53,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033502098] [2019-11-28 20:19:53,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821828700] [2019-11-28 20:19:53,171 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:53,266 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-11-28 20:19:53,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:53,267 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:19:53,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:53,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:53,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-11-28 20:19:53,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790523092] [2019-11-28 20:19:53,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:19:53,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:53,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:19:53,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:19:53,309 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 14 states. [2019-11-28 20:19:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:53,398 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 20:19:53,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:19:53,398 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2019-11-28 20:19:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:53,399 INFO L225 Difference]: With dead ends: 54 [2019-11-28 20:19:53,399 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 20:19:53,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:19:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 20:19:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 20:19:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:19:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-11-28 20:19:53,412 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 49 [2019-11-28 20:19:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:53,412 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-11-28 20:19:53,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:19:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-11-28 20:19:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 20:19:53,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:53,415 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:53,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:53,623 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:19:53,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1223356603, now seen corresponding path program 7 times [2019-11-28 20:19:53,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:53,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754468961] [2019-11-28 20:19:53,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:19:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:19:53,746 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:19:53,746 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:19:53,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:19:53 BoogieIcfgContainer [2019-11-28 20:19:53,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:19:53,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:19:53,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:19:53,793 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:19:53,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:46" (3/4) ... [2019-11-28 20:19:53,795 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:19:53,855 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:19:53,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:19:53,857 INFO L168 Benchmark]: Toolchain (without parser) took 7800.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 956.3 MB in the beginning and 937.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 195.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:53,858 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:53,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.18 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-28 20:19:53,859 INFO L168 Benchmark]: Boogie Preprocessor took 98.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:53,859 INFO L168 Benchmark]: RCFGBuilder took 330.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:53,860 INFO L168 Benchmark]: TraceAbstraction took 7049.75 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 937.3 MB in the end (delta: 126.8 MB). Peak memory consumption was 208.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:53,860 INFO L168 Benchmark]: Witness Printer took 63.36 ms. Allocated memory is still 1.2 GB. Free memory is still 937.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:53,863 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.26 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 253.18 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 Preprocessor took 98.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 330.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7049.75 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 937.3 MB in the end (delta: 126.8 MB). Peak memory consumption was 208.6 MB. Max. memory is 11.5 GB. * Witness Printer took 63.36 ms. Allocated memory is still 1.2 GB. Free memory is still 937.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 20]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, i=0, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=0] [L13] ++n VAL [a={2:0}, i=0, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=1] [L13] ++n VAL [a={2:0}, i=0, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=2] [L13] ++n VAL [a={2:0}, i=0, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=3] [L13] ++n VAL [a={2:0}, i=0, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=4] [L13] ++n VAL [a={2:0}, i=0, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=5] [L13] ++n VAL [a={2:0}, i=0, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=6] [L13] ++n VAL [a={2:0}, i=0, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=7] [L13] ++n VAL [a={2:0}, i=0, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=8] [L13] ++n VAL [a={2:0}, i=0, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=9] [L13] ++n VAL [a={2:0}, i=0, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}, i=0, n=10] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, i=0, n=10] [L17] EXPR a[i] VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, a[i]=0, i=0, n=10] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, a[i]=0, i=0, n=10] [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 7 error locations. Result: UNSAFE, OverallTime: 6.9s, OverallIterations: 16, TraceHistogramMax: 10, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 236 SDtfs, 208 SDslu, 698 SDs, 0 SdLazy, 662 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 469 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=15, 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, 15 MinimizatonAttempts, 33 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 800 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 720 ConstructedInterpolants, 1 QuantifiedInterpolants, 70815 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1149 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 66/1169 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...