./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e 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/ArraysOfVariableLength4_true-valid-memsafety_true-termination.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 97fe3d28a1849ecc88958d9d302f4fb4c5dbb992 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:50:08,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:50:08,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:50:08,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:50:08,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:50:08,592 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:50:08,594 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:50:08,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:50:08,600 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:50:08,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:50:08,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:50:08,607 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:50:08,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:50:08,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:50:08,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:50:08,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:50:08,623 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:50:08,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:50:08,630 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:50:08,632 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:50:08,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:50:08,638 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:50:08,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:50:08,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:50:08,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:50:08,647 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:50:08,648 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:50:08,651 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:50:08,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:50:08,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:50:08,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:50:08,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:50:08,654 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:50:08,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:50:08,656 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:50:08,656 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:50:08,657 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:50:08,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:50:08,671 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:50:08,672 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:50:08,672 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:50:08,674 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:50:08,674 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:50:08,674 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:50:08,674 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:50:08,674 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:50:08,675 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:50:08,675 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:50:08,675 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:50:08,675 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:50:08,675 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:50:08,675 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:50:08,676 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:50:08,677 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:50:08,677 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:50:08,677 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:50:08,677 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:50:08,678 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:50:08,678 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:50:08,678 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:50:08,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:50:08,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:50:08,679 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:50:08,679 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:50:08,679 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:50:08,680 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 -> 97fe3d28a1849ecc88958d9d302f4fb4c5dbb992 [2018-11-28 22:50:08,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:50:08,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:50:08,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:50:08,760 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:50:08,760 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:50:08,762 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-11-28 22:50:08,819 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2daab6974/6802c81c2f5a491398ea8954847b627a/FLAGa57a7886c [2018-11-28 22:50:09,243 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:50:09,243 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-11-28 22:50:09,250 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2daab6974/6802c81c2f5a491398ea8954847b627a/FLAGa57a7886c [2018-11-28 22:50:09,624 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2daab6974/6802c81c2f5a491398ea8954847b627a [2018-11-28 22:50:09,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:50:09,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:50:09,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:50:09,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:50:09,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:50:09,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:50:09" (1/1) ... [2018-11-28 22:50:09,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1986f681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:09, skipping insertion in model container [2018-11-28 22:50:09,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:50:09" (1/1) ... [2018-11-28 22:50:09,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:50:09,665 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:50:09,878 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:50:09,890 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:50:09,911 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:50:09,927 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:50:09,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:09 WrapperNode [2018-11-28 22:50:09,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:50:09,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:50:09,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:50:09,928 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:50:09,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:09" (1/1) ... [2018-11-28 22:50:09,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:09" (1/1) ... [2018-11-28 22:50:09,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:09" (1/1) ... [2018-11-28 22:50:09,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:09" (1/1) ... [2018-11-28 22:50:09,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:09" (1/1) ... [2018-11-28 22:50:09,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:09" (1/1) ... [2018-11-28 22:50:09,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:09" (1/1) ... [2018-11-28 22:50:09,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:50:09,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:50:09,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:50:09,967 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:50:09,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:50:10,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:50:10,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:50:10,091 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-28 22:50:10,091 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:50:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-28 22:50:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:50:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:50:10,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:50:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:50:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:50:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:50:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:50:10,553 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:50:10,554 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 22:50:10,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:50:10 BoogieIcfgContainer [2018-11-28 22:50:10,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:50:10,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:50:10,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:50:10,560 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:50:10,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:50:09" (1/3) ... [2018-11-28 22:50:10,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aeb1bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:50:10, skipping insertion in model container [2018-11-28 22:50:10,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:09" (2/3) ... [2018-11-28 22:50:10,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aeb1bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:50:10, skipping insertion in model container [2018-11-28 22:50:10,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:50:10" (3/3) ... [2018-11-28 22:50:10,566 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-11-28 22:50:10,577 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:50:10,588 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-28 22:50:10,608 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-28 22:50:10,635 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:50:10,636 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:50:10,637 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:50:10,637 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:50:10,637 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:50:10,637 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:50:10,637 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:50:10,637 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:50:10,638 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:50:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-28 22:50:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:50:10,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:10,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:10,671 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:10,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:10,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2018-11-28 22:50:10,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:10,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:10,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:10,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:10,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:10,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:10,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:50:10,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:50:10,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:50:10,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:50:10,884 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-11-28 22:50:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:11,004 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-28 22:50:11,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:50:11,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:50:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:11,015 INFO L225 Difference]: With dead ends: 58 [2018-11-28 22:50:11,016 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 22:50:11,018 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 [2018-11-28 22:50:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 22:50:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-11-28 22:50:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:50:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-28 22:50:11,063 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2018-11-28 22:50:11,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:11,064 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 22:50:11,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:50:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-28 22:50:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:50:11,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:11,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:11,065 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:11,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:11,066 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2018-11-28 22:50:11,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:11,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:11,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:11,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:11,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:11,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:11,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:50:11,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:50:11,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:50:11,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:50:11,150 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2018-11-28 22:50:11,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:11,276 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-28 22:50:11,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:50:11,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 22:50:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:11,280 INFO L225 Difference]: With dead ends: 49 [2018-11-28 22:50:11,280 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 22:50:11,281 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 [2018-11-28 22:50:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 22:50:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-11-28 22:50:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:50:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-28 22:50:11,287 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2018-11-28 22:50:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:11,288 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-28 22:50:11,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:50:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-28 22:50:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 22:50:11,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:11,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:11,289 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:11,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:11,290 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2018-11-28 22:50:11,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:11,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:11,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:11,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:11,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:11,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:11,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:50:11,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:50:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:50:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:50:11,406 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-11-28 22:50:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:11,685 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-28 22:50:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:50:11,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-28 22:50:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:11,687 INFO L225 Difference]: With dead ends: 40 [2018-11-28 22:50:11,688 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 22:50:11,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:50:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 22:50:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 22:50:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:50:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-28 22:50:11,694 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2018-11-28 22:50:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:11,694 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-28 22:50:11,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:50:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-28 22:50:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 22:50:11,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:11,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:11,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:11,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:11,696 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2018-11-28 22:50:11,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:11,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:11,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:11,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:11,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:11,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:11,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:50:11,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:50:11,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:50:11,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:50:11,926 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-11-28 22:50:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:12,230 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-28 22:50:12,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:50:12,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-28 22:50:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:12,233 INFO L225 Difference]: With dead ends: 42 [2018-11-28 22:50:12,233 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 22:50:12,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:50:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 22:50:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-28 22:50:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:50:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 22:50:12,239 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2018-11-28 22:50:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:12,240 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 22:50:12,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:50:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-28 22:50:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:50:12,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:12,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:12,241 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:12,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2018-11-28 22:50:12,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:12,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:12,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:12,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:12,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:12,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:12,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:50:12,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:50:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:50:12,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:50:12,348 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2018-11-28 22:50:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:12,741 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-28 22:50:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:50:12,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-28 22:50:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:12,746 INFO L225 Difference]: With dead ends: 45 [2018-11-28 22:50:12,746 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 22:50:12,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:50:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 22:50:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-28 22:50:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:50:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-28 22:50:12,752 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2018-11-28 22:50:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:12,752 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 22:50:12,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:50:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-28 22:50:12,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 22:50:12,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:12,753 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:12,754 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:12,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2018-11-28 22:50:12,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:12,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:12,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:12,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:12,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:12,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:12,893 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 [2018-11-28 22:50:12,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:12,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:13,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:13,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2018-11-28 22:50:13,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:50:13,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:50:13,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:50:13,003 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 9 states. [2018-11-28 22:50:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:13,231 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-11-28 22:50:13,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:50:13,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-28 22:50:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:13,237 INFO L225 Difference]: With dead ends: 47 [2018-11-28 22:50:13,237 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 22:50:13,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:50:13,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 22:50:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-28 22:50:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 22:50:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-11-28 22:50:13,244 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 16 [2018-11-28 22:50:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:13,244 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-28 22:50:13,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:50:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-11-28 22:50:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 22:50:13,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:13,245 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:13,246 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:13,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash -661735507, now seen corresponding path program 1 times [2018-11-28 22:50:13,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:13,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:13,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:13,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:13,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:13,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:13,607 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 [2018-11-28 22:50:13,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:13,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:13,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:13,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-28 22:50:13,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 22:50:13,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 22:50:13,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-28 22:50:13,895 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2018-11-28 22:50:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:14,239 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-28 22:50:14,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:50:14,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-28 22:50:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:14,244 INFO L225 Difference]: With dead ends: 59 [2018-11-28 22:50:14,245 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 22:50:14,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:50:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 22:50:14,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-11-28 22:50:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 22:50:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-28 22:50:14,253 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 30 [2018-11-28 22:50:14,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:14,254 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-28 22:50:14,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 22:50:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-28 22:50:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 22:50:14,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:14,255 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:14,255 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:14,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:14,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1228723374, now seen corresponding path program 2 times [2018-11-28 22:50:14,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:14,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:14,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:14,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:14,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:14,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:14,538 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 [2018-11-28 22:50:14,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:50:14,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 22:50:14,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:50:14,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:14,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:14,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-28 22:50:14,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 22:50:14,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:14,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:14,687 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. [2018-11-28 22:50:14,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-11-28 22:50:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-28 22:50:14,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:50:14,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-28 22:50:14,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 22:50:14,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 22:50:14,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:50:14,991 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2018-11-28 22:50:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:15,607 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-11-28 22:50:15,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:50:15,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-28 22:50:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:15,610 INFO L225 Difference]: With dead ends: 62 [2018-11-28 22:50:15,610 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 22:50:15,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-28 22:50:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 22:50:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-11-28 22:50:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 22:50:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-11-28 22:50:15,618 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 35 [2018-11-28 22:50:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:15,619 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-11-28 22:50:15,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 22:50:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-28 22:50:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 22:50:15,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:15,621 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:15,622 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:15,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1819430834, now seen corresponding path program 1 times [2018-11-28 22:50:15,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:15,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:15,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:50:15,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:15,848 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-28 22:50:16,234 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-28 22:50:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:16,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:16,374 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 [2018-11-28 22:50:16,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:16,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:16,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:16,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-28 22:50:16,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 22:50:16,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 22:50:16,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-28 22:50:16,725 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 16 states. [2018-11-28 22:50:17,181 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-28 22:50:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:17,351 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-28 22:50:17,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:50:17,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-11-28 22:50:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:17,356 INFO L225 Difference]: With dead ends: 67 [2018-11-28 22:50:17,356 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 22:50:17,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-11-28 22:50:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 22:50:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-11-28 22:50:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 22:50:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-11-28 22:50:17,363 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 40 [2018-11-28 22:50:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:17,363 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-28 22:50:17,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 22:50:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-28 22:50:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 22:50:17,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:17,366 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:17,367 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:17,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2080753, now seen corresponding path program 2 times [2018-11-28 22:50:17,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:17,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:17,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:17,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:17,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:17,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:17,851 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 [2018-11-28 22:50:17,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:50:17,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 22:50:17,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:50:17,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:17,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-28 22:50:17,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:17,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:50:17,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:17,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 22:50:17,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:17,944 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:17,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:50:17,964 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-11-28 22:50:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-28 22:50:18,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:50:18,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2018-11-28 22:50:18,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 22:50:18,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 22:50:18,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:50:18,169 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 13 states. [2018-11-28 22:50:18,473 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 22:50:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:18,981 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-28 22:50:18,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:50:18,982 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-11-28 22:50:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:18,984 INFO L225 Difference]: With dead ends: 70 [2018-11-28 22:50:18,984 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 22:50:18,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2018-11-28 22:50:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 22:50:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-11-28 22:50:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 22:50:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-11-28 22:50:18,990 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 45 [2018-11-28 22:50:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:18,992 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-11-28 22:50:18,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 22:50:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-11-28 22:50:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 22:50:18,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:18,995 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:18,995 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:18,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:18,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1165684695, now seen corresponding path program 1 times [2018-11-28 22:50:18,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:18,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:18,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:18,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:50:18,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:19,089 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-28 22:50:19,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:19,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 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 [2018-11-28 22:50:19,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:19,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:19,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:19,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11] total 13 [2018-11-28 22:50:19,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 22:50:19,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 22:50:19,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:50:19,378 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 13 states. [2018-11-28 22:50:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:19,578 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-11-28 22:50:19,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:50:19,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-11-28 22:50:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:19,582 INFO L225 Difference]: With dead ends: 99 [2018-11-28 22:50:19,582 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 22:50:19,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:50:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 22:50:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2018-11-28 22:50:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 22:50:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-11-28 22:50:19,590 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 59 [2018-11-28 22:50:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:19,590 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-11-28 22:50:19,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 22:50:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-28 22:50:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 22:50:19,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:19,595 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:19,596 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 22:50:19,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:19,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1970017626, now seen corresponding path program 2 times [2018-11-28 22:50:19,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:19,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:19,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:19,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:19,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2018-11-28 22:50:19,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:19,774 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 [2018-11-28 22:50:19,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:50:19,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 22:50:19,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:50:19,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:19,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:19,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 22:50:19,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 22:50:19,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:19,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:19,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:50:19,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 22:50:20,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:20,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 22:50:20,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 22:50:20,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:20,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:20,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:50:20,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 22:50:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2018-11-28 22:50:21,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:50:21,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-11-28 22:50:21,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:50:21,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:50:21,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2018-11-28 22:50:21,245 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-11-28 22:50:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:33,281 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-11-28 22:50:33,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:50:33,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-11-28 22:50:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:33,284 INFO L225 Difference]: With dead ends: 101 [2018-11-28 22:50:33,284 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:50:33,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=173, Unknown=1, NotChecked=0, Total=240 [2018-11-28 22:50:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:50:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:50:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:50:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:50:33,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2018-11-28 22:50:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:33,286 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:50:33,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:50:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:50:33,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:50:33,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:50:33 BoogieIcfgContainer [2018-11-28 22:50:33,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:50:33,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:50:33,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:50:33,292 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:50:33,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:50:10" (3/4) ... [2018-11-28 22:50:33,297 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:50:33,303 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:50:33,304 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-28 22:50:33,304 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:50:33,309 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-28 22:50:33,309 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 22:50:33,309 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 22:50:33,309 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 22:50:33,358 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:50:33,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:50:33,360 INFO L168 Benchmark]: Toolchain (without parser) took 23732.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.8 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -285.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:33,361 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:50:33,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.07 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:33,362 INFO L168 Benchmark]: Boogie Preprocessor took 38.23 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:50:33,364 INFO L168 Benchmark]: RCFGBuilder took 588.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:33,364 INFO L168 Benchmark]: TraceAbstraction took 22735.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.4 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:33,365 INFO L168 Benchmark]: Witness Printer took 66.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:33,370 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.07 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.23 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 588.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22735.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.4 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Witness Printer took 66.58 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: 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: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: 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, 22.6s OverallTime, 12 OverallIterations, 16 TraceHistogramMax, 16.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 315 SDtfs, 483 SDslu, 1344 SDs, 0 SdLazy, 946 SolverSat, 81 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 317 SyntacticMatches, 5 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=11, 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.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 740 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 721 ConstructedInterpolants, 159 QuantifiedInterpolants, 362989 SizeOfPredicates, 8 NumberOfNonLiveVariables, 665 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 1511/1896 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...