./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 32bit --witnessprinter.graph.data.programhash a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 22:55:28,684 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:55:28,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:55:28,698 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:55:28,699 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:55:28,700 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:55:28,702 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:55:28,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:55:28,705 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:55:28,706 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:55:28,707 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:55:28,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:55:28,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:55:28,710 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:55:28,711 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:55:28,712 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:55:28,713 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:55:28,715 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:55:28,718 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:55:28,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:55:28,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:55:28,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:55:28,725 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:55:28,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:55:28,725 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:55:28,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:55:28,728 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:55:28,729 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:55:28,729 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:55:28,731 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:55:28,731 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:55:28,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:55:28,732 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:55:28,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:55:28,734 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:55:28,735 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:55:28,735 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 22:55:28,751 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:55:28,751 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:55:28,753 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:55:28,753 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:55:28,753 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:55:28,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:55:28,754 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:55:28,754 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:55:28,754 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:55:28,754 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:55:28,754 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:55:28,754 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:55:28,755 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:55:28,755 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:55:28,755 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:55:28,755 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:55:28,755 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:55:28,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:55:28,757 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:55:28,757 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:55:28,758 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:55:28,758 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:55:28,758 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:55:28,758 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:55:28,758 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:55:28,759 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:55:28,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 [2019-01-13 22:55:28,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:55:28,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:55:28,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:55:28,823 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:55:28,823 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:55:28,824 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2019-01-13 22:55:28,894 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e772ce80a/2503fa17088b49139501eb9a07485a22/FLAG394dc2099 [2019-01-13 22:55:29,322 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:55:29,325 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2019-01-13 22:55:29,333 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e772ce80a/2503fa17088b49139501eb9a07485a22/FLAG394dc2099 [2019-01-13 22:55:29,675 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e772ce80a/2503fa17088b49139501eb9a07485a22 [2019-01-13 22:55:29,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:55:29,680 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:55:29,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:55:29,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:55:29,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:55:29,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:55:29" (1/1) ... [2019-01-13 22:55:29,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f8ae22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:29, skipping insertion in model container [2019-01-13 22:55:29,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:55:29" (1/1) ... [2019-01-13 22:55:29,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:55:29,715 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:55:29,921 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:55:29,933 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:55:29,952 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:55:29,966 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:55:29,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:29 WrapperNode [2019-01-13 22:55:29,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:55:29,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:55:29,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:55:29,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:55:29,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:29" (1/1) ... [2019-01-13 22:55:29,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:29" (1/1) ... [2019-01-13 22:55:29,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:29" (1/1) ... [2019-01-13 22:55:29,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:29" (1/1) ... [2019-01-13 22:55:29,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:29" (1/1) ... [2019-01-13 22:55:30,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:29" (1/1) ... [2019-01-13 22:55:30,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:29" (1/1) ... [2019-01-13 22:55:30,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:55:30,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:55:30,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:55:30,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:55:30,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:29" (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-01-13 22:55:30,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:55:30,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:55:30,129 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-01-13 22:55:30,130 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:55:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-01-13 22:55:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 22:55:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:55:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:55:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 22:55:30,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:55:30,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:55:30,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:55:30,577 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:55:30,577 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-13 22:55:30,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:55:30 BoogieIcfgContainer [2019-01-13 22:55:30,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:55:30,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:55:30,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:55:30,585 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:55:30,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:55:29" (1/3) ... [2019-01-13 22:55:30,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704cc510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:55:30, skipping insertion in model container [2019-01-13 22:55:30,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:29" (2/3) ... [2019-01-13 22:55:30,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704cc510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:55:30, skipping insertion in model container [2019-01-13 22:55:30,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:55:30" (3/3) ... [2019-01-13 22:55:30,589 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2019-01-13 22:55:30,598 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:55:30,606 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-13 22:55:30,622 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-13 22:55:30,645 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:55:30,646 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:55:30,646 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:55:30,646 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:55:30,647 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:55:30,647 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:55:30,647 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:55:30,647 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:55:30,647 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:55:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-01-13 22:55:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:55:30,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:30,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:30,677 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:30,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-01-13 22:55:30,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:30,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:30,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:30,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:30,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:30,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:30,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:55:30,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:55:30,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:55:30,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:30,852 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-13 22:55:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:30,988 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-13 22:55:30,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:30,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:55:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:31,000 INFO L225 Difference]: With dead ends: 58 [2019-01-13 22:55:31,000 INFO L226 Difference]: Without dead ends: 54 [2019-01-13 22:55:31,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-13 22:55:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-01-13 22:55:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 22:55:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-13 22:55:31,040 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-01-13 22:55:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:31,041 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-13 22:55:31,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:55:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-13 22:55:31,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:55:31,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:31,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:31,043 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:31,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-01-13 22:55:31,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:31,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:31,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:31,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:31,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:31,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:31,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:55:31,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:55:31,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:55:31,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:31,206 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2019-01-13 22:55:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:31,520 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-01-13 22:55:31,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:55:31,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-01-13 22:55:31,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:31,523 INFO L225 Difference]: With dead ends: 59 [2019-01-13 22:55:31,523 INFO L226 Difference]: Without dead ends: 59 [2019-01-13 22:55:31,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-13 22:55:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2019-01-13 22:55:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 22:55:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-13 22:55:31,534 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2019-01-13 22:55:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:31,534 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-13 22:55:31,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:55:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-13 22:55:31,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:55:31,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:31,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:31,536 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:31,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:31,538 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-01-13 22:55:31,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:31,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:31,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:31,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:31,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:31,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:31,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:55:31,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:55:31,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:55:31,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:31,636 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2019-01-13 22:55:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:31,723 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-13 22:55:31,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:31,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-13 22:55:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:31,727 INFO L225 Difference]: With dead ends: 43 [2019-01-13 22:55:31,727 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 22:55:31,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 22:55:31,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 22:55:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 22:55:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-01-13 22:55:31,740 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2019-01-13 22:55:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:31,741 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-01-13 22:55:31,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:55:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-01-13 22:55:31,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:55:31,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:31,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:31,743 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:31,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:31,743 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2019-01-13 22:55:31,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:31,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:31,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:31,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:31,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:31,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:55:31,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:55:31,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:55:31,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:31,818 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2019-01-13 22:55:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:31,945 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-01-13 22:55:31,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:31,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-13 22:55:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:31,948 INFO L225 Difference]: With dead ends: 47 [2019-01-13 22:55:31,948 INFO L226 Difference]: Without dead ends: 47 [2019-01-13 22:55:31,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-13 22:55:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-01-13 22:55:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 22:55:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-13 22:55:31,963 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2019-01-13 22:55:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:31,966 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-13 22:55:31,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:55:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-13 22:55:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 22:55:31,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:31,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:31,969 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:31,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2019-01-13 22:55:31,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:31,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:31,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:31,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:31,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:32,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:32,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:32,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:32,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:32,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:32,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-13 22:55:32,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:55:32,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:55:32,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:32,203 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2019-01-13 22:55:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:32,361 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-13 22:55:32,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 22:55:32,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-13 22:55:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:32,365 INFO L225 Difference]: With dead ends: 69 [2019-01-13 22:55:32,365 INFO L226 Difference]: Without dead ends: 69 [2019-01-13 22:55:32,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:32,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-13 22:55:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2019-01-13 22:55:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-13 22:55:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-01-13 22:55:32,372 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2019-01-13 22:55:32,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:32,373 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-01-13 22:55:32,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:55:32,373 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-01-13 22:55:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 22:55:32,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:32,374 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:32,375 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:32,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:32,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2019-01-13 22:55:32,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:32,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:32,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:32,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 22:55:32,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:32,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:55:32,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:55:32,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:55:32,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:32,502 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2019-01-13 22:55:32,929 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 22:55:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:33,214 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-01-13 22:55:33,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:55:33,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-13 22:55:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:33,217 INFO L225 Difference]: With dead ends: 62 [2019-01-13 22:55:33,218 INFO L226 Difference]: Without dead ends: 62 [2019-01-13 22:55:33,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:55:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-13 22:55:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2019-01-13 22:55:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-13 22:55:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-01-13 22:55:33,231 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2019-01-13 22:55:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:33,232 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-01-13 22:55:33,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:55:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-01-13 22:55:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 22:55:33,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:33,236 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:33,237 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:33,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:33,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2019-01-13 22:55:33,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:33,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:33,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:33,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:33,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:33,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:55:33,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:55:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:55:33,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:33,386 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2019-01-13 22:55:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:33,561 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-01-13 22:55:33,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:55:33,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-13 22:55:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:33,565 INFO L225 Difference]: With dead ends: 53 [2019-01-13 22:55:33,565 INFO L226 Difference]: Without dead ends: 53 [2019-01-13 22:55:33,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-13 22:55:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-13 22:55:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-13 22:55:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-01-13 22:55:33,572 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2019-01-13 22:55:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:33,573 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-01-13 22:55:33,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:55:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-01-13 22:55:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 22:55:33,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:33,574 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:33,574 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:33,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:33,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2019-01-13 22:55:33,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:33,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:33,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:33,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:33,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:33,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:33,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:33,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:33,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:33,960 INFO L478 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-01-13 22:55:33,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:33,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:33,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:55:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 22:55:34,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:34,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-01-13 22:55:34,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 22:55:34,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 22:55:34,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 22:55:34,137 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 12 states. [2019-01-13 22:55:34,381 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-01-13 22:55:34,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:34,736 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-01-13 22:55:34,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 22:55:34,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-01-13 22:55:34,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:34,740 INFO L225 Difference]: With dead ends: 64 [2019-01-13 22:55:34,740 INFO L226 Difference]: Without dead ends: 64 [2019-01-13 22:55:34,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:55:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-13 22:55:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2019-01-13 22:55:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-13 22:55:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-01-13 22:55:34,748 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2019-01-13 22:55:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:34,749 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-01-13 22:55:34,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 22:55:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-01-13 22:55:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 22:55:34,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:34,750 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:34,750 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:34,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2019-01-13 22:55:34,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:34,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:34,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:34,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:34,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-13 22:55:35,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:35,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:55:35,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:55:35,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:55:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:35,062 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2019-01-13 22:55:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:35,141 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-01-13 22:55:35,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:55:35,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-13 22:55:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:35,143 INFO L225 Difference]: With dead ends: 52 [2019-01-13 22:55:35,144 INFO L226 Difference]: Without dead ends: 52 [2019-01-13 22:55:35,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-13 22:55:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-01-13 22:55:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-13 22:55:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-01-13 22:55:35,149 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 26 [2019-01-13 22:55:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:35,150 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-01-13 22:55:35,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:55:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-01-13 22:55:35,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:55:35,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:35,151 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:35,151 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:35,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:35,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2019-01-13 22:55:35,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:35,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:35,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:35,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:35,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:35,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:35,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:35,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:35,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:35,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:35,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-01-13 22:55:35,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 22:55:35,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 22:55:35,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-13 22:55:35,453 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 11 states. [2019-01-13 22:55:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:35,776 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-01-13 22:55:35,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:55:35,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-01-13 22:55:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:35,783 INFO L225 Difference]: With dead ends: 78 [2019-01-13 22:55:35,783 INFO L226 Difference]: Without dead ends: 78 [2019-01-13 22:55:35,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-13 22:55:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-13 22:55:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2019-01-13 22:55:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-13 22:55:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-01-13 22:55:35,791 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 27 [2019-01-13 22:55:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:35,791 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-01-13 22:55:35,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 22:55:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-01-13 22:55:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 22:55:35,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:35,793 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:35,793 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:35,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:35,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1979886526, now seen corresponding path program 2 times [2019-01-13 22:55:35,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:35,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:35,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:35,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:35,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-13 22:55:35,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:35,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:35,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 22:55:35,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:35,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:35,926 INFO L478 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-01-13 22:55:35,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:35,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:35,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:55:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-13 22:55:36,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:36,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-01-13 22:55:36,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:55:36,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:55:36,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:55:36,148 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 9 states. [2019-01-13 22:55:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:36,440 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-01-13 22:55:36,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 22:55:36,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-01-13 22:55:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:36,443 INFO L225 Difference]: With dead ends: 89 [2019-01-13 22:55:36,443 INFO L226 Difference]: Without dead ends: 89 [2019-01-13 22:55:36,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-13 22:55:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-13 22:55:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-01-13 22:55:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-13 22:55:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-01-13 22:55:36,451 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 32 [2019-01-13 22:55:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:36,451 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-01-13 22:55:36,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:55:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-01-13 22:55:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 22:55:36,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:36,453 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:36,454 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:36,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2014379143, now seen corresponding path program 2 times [2019-01-13 22:55:36,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:36,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:36,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:36,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:55:36,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-13 22:55:36,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:36,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:36,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:36,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 22:55:36,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:36,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-13 22:55:37,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:37,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2019-01-13 22:55:37,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-13 22:55:37,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-13 22:55:37,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-01-13 22:55:37,132 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 14 states. [2019-01-13 22:55:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:37,499 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-01-13 22:55:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 22:55:37,500 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-01-13 22:55:37,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:37,502 INFO L225 Difference]: With dead ends: 95 [2019-01-13 22:55:37,502 INFO L226 Difference]: Without dead ends: 89 [2019-01-13 22:55:37,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-01-13 22:55:37,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-13 22:55:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-01-13 22:55:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-13 22:55:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2019-01-13 22:55:37,508 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 38 [2019-01-13 22:55:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:37,509 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2019-01-13 22:55:37,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-13 22:55:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2019-01-13 22:55:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 22:55:37,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:37,510 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:37,511 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:37,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 3 times [2019-01-13 22:55:37,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:37,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:37,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:37,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:55:37,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-13 22:55:38,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:38,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:38,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 22:55:38,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-13 22:55:38,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:38,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-13 22:55:38,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:38,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-01-13 22:55:38,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:55:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:55:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:55:38,192 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 7 states. [2019-01-13 22:55:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:38,311 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-01-13 22:55:38,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:55:38,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-01-13 22:55:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:38,316 INFO L225 Difference]: With dead ends: 82 [2019-01-13 22:55:38,316 INFO L226 Difference]: Without dead ends: 82 [2019-01-13 22:55:38,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:55:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-13 22:55:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-01-13 22:55:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-13 22:55:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2019-01-13 22:55:38,322 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 43 [2019-01-13 22:55:38,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:38,323 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2019-01-13 22:55:38,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:55:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2019-01-13 22:55:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 22:55:38,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:38,325 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:38,326 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:38,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:38,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2125667663, now seen corresponding path program 1 times [2019-01-13 22:55:38,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:38,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:38,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:38,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:55:38,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-13 22:55:38,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:38,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:38,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:38,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-13 22:55:39,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:39,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-01-13 22:55:39,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 22:55:39,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 22:55:39,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:55:39,714 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 13 states. [2019-01-13 22:55:40,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:40,235 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2019-01-13 22:55:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 22:55:40,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-01-13 22:55:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:40,238 INFO L225 Difference]: With dead ends: 123 [2019-01-13 22:55:40,238 INFO L226 Difference]: Without dead ends: 120 [2019-01-13 22:55:40,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-01-13 22:55:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-13 22:55:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2019-01-13 22:55:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-13 22:55:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2019-01-13 22:55:40,244 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 72 [2019-01-13 22:55:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:40,244 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2019-01-13 22:55:40,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 22:55:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2019-01-13 22:55:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-13 22:55:40,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:40,246 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:40,246 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-13 22:55:40,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash 241209475, now seen corresponding path program 2 times [2019-01-13 22:55:40,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:40,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:40,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:40,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:40,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-13 22:55:40,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:40,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:40,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:40,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 22:55:40,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:40,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:40,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:40,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-13 22:55:40,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:40,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:55:40,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-13 22:55:40,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:40,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-13 22:55:40,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:40,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:55:40,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-13 22:55:40,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:40,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-13 22:55:40,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:40,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:55:40,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-13 22:55:40,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:40,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-13 22:55:40,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:40,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:55:40,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-13 22:55:40,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:40,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-13 22:55:40,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:40,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:55:40,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-13 22:55:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-01-13 22:55:41,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:41,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2019-01-13 22:55:41,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 22:55:41,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 22:55:41,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2019-01-13 22:55:41,447 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 12 states. [2019-01-13 22:55:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:42,566 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2019-01-13 22:55:42,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 22:55:42,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2019-01-13 22:55:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:42,568 INFO L225 Difference]: With dead ends: 122 [2019-01-13 22:55:42,568 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 22:55:42,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=162, Invalid=437, Unknown=1, NotChecked=0, Total=600 [2019-01-13 22:55:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 22:55:42,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 22:55:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 22:55:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 22:55:42,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2019-01-13 22:55:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:42,570 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 22:55:42,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 22:55:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 22:55:42,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 22:55:42,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:55:42 BoogieIcfgContainer [2019-01-13 22:55:42,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:55:42,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:55:42,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:55:42,578 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:55:42,579 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:55:30" (3/4) ... [2019-01-13 22:55:42,582 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 22:55:42,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 22:55:42,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-01-13 22:55:42,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 22:55:42,595 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-01-13 22:55:42,595 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-13 22:55:42,595 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-13 22:55:42,595 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 22:55:42,644 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 22:55:42,644 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:55:42,645 INFO L168 Benchmark]: Toolchain (without parser) took 12965.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 946.0 MB in the beginning and 819.0 MB in the end (delta: 127.0 MB). Peak memory consumption was 336.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:42,646 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:55:42,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.75 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:42,647 INFO L168 Benchmark]: Boogie Preprocessor took 37.94 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:55:42,648 INFO L168 Benchmark]: RCFGBuilder took 573.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:42,648 INFO L168 Benchmark]: TraceAbstraction took 11996.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 819.0 MB in the end (delta: 300.4 MB). Peak memory consumption was 360.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:42,649 INFO L168 Benchmark]: Witness Printer took 66.51 ms. Allocated memory is still 1.2 GB. Free memory was 819.0 MB in the beginning and 819.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-13 22:55:42,653 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.75 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.94 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 573.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11996.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 819.0 MB in the end (delta: 300.4 MB). Peak memory consumption was 360.7 MB. Max. memory is 11.5 GB. * Witness Printer took 66.51 ms. Allocated memory is still 1.2 GB. Free memory was 819.0 MB in the beginning and 819.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. SAFE Result, 11.9s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 383 SDtfs, 897 SDslu, 1024 SDs, 0 SdLazy, 1413 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 346 SyntacticMatches, 15 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 134 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 840 NumberOfCodeBlocks, 712 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 817 ConstructedInterpolants, 76 QuantifiedInterpolants, 158485 SizeOfPredicates, 15 NumberOfNonLiveVariables, 872 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 754/881 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...