./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32d9f155778c5c4efaa55d37fdad329bb0d271b5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 19:06:36,889 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 19:06:36,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 19:06:36,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 19:06:36,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 19:06:36,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 19:06:36,906 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 19:06:36,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 19:06:36,910 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 19:06:36,911 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 19:06:36,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 19:06:36,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 19:06:36,914 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 19:06:36,915 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 19:06:36,916 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 19:06:36,917 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 19:06:36,918 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 19:06:36,920 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 19:06:36,922 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 19:06:36,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 19:06:36,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 19:06:36,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 19:06:36,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 19:06:36,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 19:06:36,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 19:06:36,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 19:06:36,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 19:06:36,933 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 19:06:36,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 19:06:36,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 19:06:36,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 19:06:36,937 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 19:06:36,937 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 19:06:36,937 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 19:06:36,938 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 19:06:36,939 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 19:06:36,939 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 19:06:36,967 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 19:06:36,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 19:06:36,969 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 19:06:36,969 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 19:06:36,970 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 19:06:36,970 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 19:06:36,970 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 19:06:36,970 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 19:06:36,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 19:06:36,970 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 19:06:36,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 19:06:36,972 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 19:06:36,972 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 19:06:36,972 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 19:06:36,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 19:06:36,972 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 19:06:36,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 19:06:36,974 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 19:06:36,974 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 19:06:36,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 19:06:36,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:06:36,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 19:06:36,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 19:06:36,975 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 19:06:36,975 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 19:06:36,975 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 -> 32d9f155778c5c4efaa55d37fdad329bb0d271b5 [2019-01-14 19:06:37,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 19:06:37,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 19:06:37,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 19:06:37,056 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 19:06:37,056 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 19:06:37,057 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2019-01-14 19:06:37,123 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d5d54cc/1db84293f75d4f0f9d96819ff891af42/FLAG79ddda510 [2019-01-14 19:06:37,564 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 19:06:37,564 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2019-01-14 19:06:37,569 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d5d54cc/1db84293f75d4f0f9d96819ff891af42/FLAG79ddda510 [2019-01-14 19:06:37,910 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d5d54cc/1db84293f75d4f0f9d96819ff891af42 [2019-01-14 19:06:37,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 19:06:37,918 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 19:06:37,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 19:06:37,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 19:06:37,924 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 19:06:37,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:06:37" (1/1) ... [2019-01-14 19:06:37,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2907c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:37, skipping insertion in model container [2019-01-14 19:06:37,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:06:37" (1/1) ... [2019-01-14 19:06:37,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 19:06:37,958 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 19:06:38,173 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:06:38,185 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 19:06:38,208 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:06:38,233 INFO L195 MainTranslator]: Completed translation [2019-01-14 19:06:38,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:38 WrapperNode [2019-01-14 19:06:38,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 19:06:38,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 19:06:38,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 19:06:38,235 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 19:06:38,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:38" (1/1) ... [2019-01-14 19:06:38,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:38" (1/1) ... [2019-01-14 19:06:38,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:38" (1/1) ... [2019-01-14 19:06:38,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:38" (1/1) ... [2019-01-14 19:06:38,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:38" (1/1) ... [2019-01-14 19:06:38,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:38" (1/1) ... [2019-01-14 19:06:38,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:38" (1/1) ... [2019-01-14 19:06:38,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 19:06:38,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 19:06:38,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 19:06:38,288 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 19:06:38,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:06:38,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 19:06:38,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 19:06:38,420 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-01-14 19:06:38,420 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 19:06:38,420 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-01-14 19:06:38,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 19:06:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 19:06:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 19:06:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 19:06:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 19:06:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 19:06:38,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 19:06:38,917 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 19:06:38,917 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-14 19:06:38,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:06:38 BoogieIcfgContainer [2019-01-14 19:06:38,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 19:06:38,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 19:06:38,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 19:06:38,923 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 19:06:38,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 07:06:37" (1/3) ... [2019-01-14 19:06:38,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbfff50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:06:38, skipping insertion in model container [2019-01-14 19:06:38,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:38" (2/3) ... [2019-01-14 19:06:38,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbfff50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:06:38, skipping insertion in model container [2019-01-14 19:06:38,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:06:38" (3/3) ... [2019-01-14 19:06:38,928 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2019-01-14 19:06:38,938 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 19:06:38,946 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-14 19:06:38,963 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-14 19:06:38,987 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 19:06:38,988 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 19:06:38,988 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 19:06:38,988 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 19:06:38,988 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 19:06:38,988 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 19:06:38,989 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 19:06:38,989 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 19:06:38,989 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 19:06:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-01-14 19:06:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 19:06:39,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:39,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:39,019 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-01-14 19:06:39,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:39,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:39,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:39,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:39,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:39,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 19:06:39,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:06:39,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:06:39,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:39,215 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-14 19:06:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:39,369 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-14 19:06:39,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:06:39,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 19:06:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:39,379 INFO L225 Difference]: With dead ends: 58 [2019-01-14 19:06:39,379 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 19:06:39,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:39,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 19:06:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-01-14 19:06:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 19:06:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-14 19:06:39,423 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-01-14 19:06:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:39,423 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-14 19:06:39,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:06:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-14 19:06:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 19:06:39,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:39,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:39,425 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:39,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:39,425 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-01-14 19:06:39,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:39,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:39,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:39,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:39,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:06:39,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:06:39,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:06:39,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:06:39,601 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2019-01-14 19:06:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:39,958 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-01-14 19:06:39,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:06:39,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-01-14 19:06:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:39,963 INFO L225 Difference]: With dead ends: 59 [2019-01-14 19:06:39,964 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 19:06:39,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:06:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 19:06:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2019-01-14 19:06:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 19:06:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-14 19:06:39,973 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2019-01-14 19:06:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:39,974 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-14 19:06:39,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:06:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-14 19:06:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 19:06:39,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:39,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:39,976 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-01-14 19:06:39,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:39,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:39,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:39,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:39,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:40,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:40,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 19:06:40,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:06:40,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:06:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:40,107 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2019-01-14 19:06:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:40,148 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-14 19:06:40,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:06:40,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 19:06:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:40,153 INFO L225 Difference]: With dead ends: 43 [2019-01-14 19:06:40,153 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 19:06:40,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 19:06:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-14 19:06:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 19:06:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-01-14 19:06:40,160 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2019-01-14 19:06:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:40,160 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-01-14 19:06:40,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:06:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-01-14 19:06:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 19:06:40,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:40,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:40,162 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:40,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2019-01-14 19:06:40,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:40,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:40,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:40,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:40,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:40,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:40,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 19:06:40,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:06:40,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:06:40,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:40,239 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2019-01-14 19:06:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:40,378 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-01-14 19:06:40,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:06:40,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 19:06:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:40,380 INFO L225 Difference]: With dead ends: 47 [2019-01-14 19:06:40,380 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 19:06:40,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 19:06:40,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-01-14 19:06:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 19:06:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-14 19:06:40,387 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2019-01-14 19:06:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:40,387 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-14 19:06:40,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:06:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-14 19:06:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 19:06:40,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:40,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:40,390 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:40,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2019-01-14 19:06:40,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:40,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:40,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:40,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:40,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:40,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:40,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:40,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:40,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:40,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:40,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 19:06:40,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:06:40,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:06:40,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:06:40,565 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2019-01-14 19:06:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:40,723 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-14 19:06:40,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 19:06:40,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 19:06:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:40,727 INFO L225 Difference]: With dead ends: 69 [2019-01-14 19:06:40,730 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 19:06:40,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:06:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 19:06:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2019-01-14 19:06:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 19:06:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-01-14 19:06:40,752 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2019-01-14 19:06:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:40,753 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-01-14 19:06:40,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:06:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-01-14 19:06:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 19:06:40,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:40,755 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:40,759 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2019-01-14 19:06:40,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:40,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:40,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:40,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:40,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:41,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:41,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:41,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:41,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 19:06:41,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:06:41,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-01-14 19:06:41,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 19:06:41,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 19:06:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 19:06:41,426 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 7 states. [2019-01-14 19:06:41,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:41,716 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-01-14 19:06:41,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:06:41,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-01-14 19:06:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:41,720 INFO L225 Difference]: With dead ends: 101 [2019-01-14 19:06:41,720 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 19:06:41,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:06:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 19:06:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 54. [2019-01-14 19:06:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 19:06:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-01-14 19:06:41,728 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2019-01-14 19:06:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:41,728 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-01-14 19:06:41,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 19:06:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-01-14 19:06:41,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 19:06:41,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:41,733 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:41,733 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:41,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:41,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2019-01-14 19:06:41,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:41,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:41,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:41,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 19:06:41,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:41,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:41,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:41,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:41,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 19:06:41,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 19:06:41,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:41,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:41,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:06:41,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-14 19:06:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 19:06:42,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:42,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2019-01-14 19:06:42,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 19:06:42,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 19:06:42,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 19:06:42,108 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 7 states. [2019-01-14 19:06:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:42,286 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-01-14 19:06:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:06:42,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-14 19:06:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:42,288 INFO L225 Difference]: With dead ends: 53 [2019-01-14 19:06:42,288 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 19:06:42,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:06:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 19:06:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-14 19:06:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 19:06:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-01-14 19:06:42,293 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2019-01-14 19:06:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:42,294 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-01-14 19:06:42,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 19:06:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-01-14 19:06:42,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 19:06:42,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:42,295 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:42,295 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:42,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:42,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2019-01-14 19:06:42,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:42,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:42,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:42,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:42,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 19:06:42,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:42,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:42,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:42,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:42,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 19:06:42,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:42,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 19:06:42,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 19:06:42,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 19:06:42,631 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 2 xjuncts. [2019-01-14 19:06:42,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:24 [2019-01-14 19:06:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 19:06:42,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:42,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-01-14 19:06:42,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 19:06:42,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 19:06:42,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:06:42,775 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 9 states. [2019-01-14 19:06:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:43,174 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-01-14 19:06:43,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:06:43,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-01-14 19:06:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:43,176 INFO L225 Difference]: With dead ends: 55 [2019-01-14 19:06:43,177 INFO L226 Difference]: Without dead ends: 55 [2019-01-14 19:06:43,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:06:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-14 19:06:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-14 19:06:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 19:06:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-01-14 19:06:43,183 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2019-01-14 19:06:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:43,184 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-01-14 19:06:43,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 19:06:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-01-14 19:06:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 19:06:43,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:43,185 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:43,185 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:43,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:43,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2019-01-14 19:06:43,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:43,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:43,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:43,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:43,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 19:06:43,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:43,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:43,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:43,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 19:06:43,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:06:43,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-01-14 19:06:43,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 19:06:43,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 19:06:43,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:06:43,485 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 9 states. [2019-01-14 19:06:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:43,773 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-01-14 19:06:43,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:06:43,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-01-14 19:06:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:43,776 INFO L225 Difference]: With dead ends: 62 [2019-01-14 19:06:43,776 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 19:06:43,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:06:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 19:06:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2019-01-14 19:06:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 19:06:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-01-14 19:06:43,781 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 26 [2019-01-14 19:06:43,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:43,781 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-01-14 19:06:43,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 19:06:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-01-14 19:06:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 19:06:43,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:43,783 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:43,783 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:43,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:43,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2019-01-14 19:06:43,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:43,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:43,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:43,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:43,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:44,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:44,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:44,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:44,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:44,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:44,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-01-14 19:06:44,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:06:44,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:06:44,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:06:44,486 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 11 states. [2019-01-14 19:06:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:44,811 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-14 19:06:44,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:06:44,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-01-14 19:06:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:44,813 INFO L225 Difference]: With dead ends: 79 [2019-01-14 19:06:44,813 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 19:06:44,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:06:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 19:06:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2019-01-14 19:06:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 19:06:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-01-14 19:06:44,818 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2019-01-14 19:06:44,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:44,818 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-01-14 19:06:44,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:06:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-01-14 19:06:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 19:06:44,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:44,819 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:44,822 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash -790766996, now seen corresponding path program 1 times [2019-01-14 19:06:44,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:44,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:44,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:44,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:44,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 19:06:44,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:44,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:44,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:44,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:44,989 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 [2019-01-14 19:06:44,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:45,006 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 [2019-01-14 19:06:45,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:45,012 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 [2019-01-14 19:06:45,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:45,026 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:45,040 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. [2019-01-14 19:06:45,040 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-01-14 19:06:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 19:06:45,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:45,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-14 19:06:45,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:06:45,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:06:45,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:06:45,419 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 8 states. [2019-01-14 19:06:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:45,700 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2019-01-14 19:06:45,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:06:45,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-01-14 19:06:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:45,702 INFO L225 Difference]: With dead ends: 67 [2019-01-14 19:06:45,702 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 19:06:45,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:06:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 19:06:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-01-14 19:06:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 19:06:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-01-14 19:06:45,710 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 31 [2019-01-14 19:06:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:45,710 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-01-14 19:06:45,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:06:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-01-14 19:06:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 19:06:45,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:45,713 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:45,714 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:45,715 INFO L82 PathProgramCache]: Analyzing trace with hash 894123677, now seen corresponding path program 1 times [2019-01-14 19:06:45,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:45,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:45,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:45,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:45,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 19:06:45,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:45,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:45,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:45,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 19:06:45,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:45,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 19:06:45,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:06:45,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:06:45,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:06:45,963 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 6 states. [2019-01-14 19:06:46,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:46,113 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2019-01-14 19:06:46,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:06:46,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-01-14 19:06:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:46,115 INFO L225 Difference]: With dead ends: 93 [2019-01-14 19:06:46,116 INFO L226 Difference]: Without dead ends: 93 [2019-01-14 19:06:46,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:06:46,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-14 19:06:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2019-01-14 19:06:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 19:06:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2019-01-14 19:06:46,123 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 37 [2019-01-14 19:06:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:46,123 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2019-01-14 19:06:46,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:06:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2019-01-14 19:06:46,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 19:06:46,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:46,124 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:46,125 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 2 times [2019-01-14 19:06:46,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:46,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:46,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:46,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:46,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 19:06:46,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:46,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:46,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:06:46,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 19:06:46,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:06:46,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 19:06:46,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:46,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-01-14 19:06:46,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 19:06:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 19:06:46,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-14 19:06:46,455 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 15 states. [2019-01-14 19:06:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:46,787 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-14 19:06:46,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 19:06:46,788 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-01-14 19:06:46,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:46,790 INFO L225 Difference]: With dead ends: 117 [2019-01-14 19:06:46,790 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 19:06:46,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-01-14 19:06:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 19:06:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2019-01-14 19:06:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 19:06:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2019-01-14 19:06:46,796 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 43 [2019-01-14 19:06:46,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:46,797 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2019-01-14 19:06:46,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 19:06:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2019-01-14 19:06:46,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 19:06:46,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:46,798 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:46,798 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:46,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2073773289, now seen corresponding path program 2 times [2019-01-14 19:06:46,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:46,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:46,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:46,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:06:46,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 19:06:46,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:46,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:46,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:06:47,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 19:06:47,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:06:47,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 19:06:47,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:47,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-01-14 19:06:47,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 19:06:47,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 19:06:47,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-01-14 19:06:47,520 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 13 states. [2019-01-14 19:06:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:48,420 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2019-01-14 19:06:48,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 19:06:48,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-01-14 19:06:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:48,422 INFO L225 Difference]: With dead ends: 122 [2019-01-14 19:06:48,422 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 19:06:48,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-01-14 19:06:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 19:06:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2019-01-14 19:06:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 19:06:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2019-01-14 19:06:48,430 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 47 [2019-01-14 19:06:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:48,430 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2019-01-14 19:06:48,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 19:06:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2019-01-14 19:06:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 19:06:48,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:48,433 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:48,434 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:48,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1381084076, now seen corresponding path program 3 times [2019-01-14 19:06:48,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:48,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:48,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:06:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-01-14 19:06:48,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:48,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:48,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 19:06:48,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 19:06:48,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:06:48,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:48,668 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 [2019-01-14 19:06:48,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:48,678 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 [2019-01-14 19:06:48,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:48,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-14 19:06:48,685 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:48,693 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:48,699 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. [2019-01-14 19:06:48,700 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-01-14 19:06:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-14 19:06:49,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:49,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2019-01-14 19:06:49,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 19:06:49,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 19:06:49,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:06:49,043 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 12 states. [2019-01-14 19:06:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:49,443 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-01-14 19:06:49,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:06:49,444 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-01-14 19:06:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:49,446 INFO L225 Difference]: With dead ends: 99 [2019-01-14 19:06:49,447 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 19:06:49,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-01-14 19:06:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 19:06:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-01-14 19:06:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 19:06:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2019-01-14 19:06:49,452 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 52 [2019-01-14 19:06:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:49,452 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2019-01-14 19:06:49,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 19:06:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2019-01-14 19:06:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-14 19:06:49,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:49,454 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:49,463 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash 267240299, now seen corresponding path program 1 times [2019-01-14 19:06:49,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:49,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:49,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:49,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:06:49,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-14 19:06:50,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:50,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:50,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:50,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-14 19:06:50,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:50,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-01-14 19:06:50,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 19:06:50,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 19:06:50,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-01-14 19:06:50,336 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 15 states. [2019-01-14 19:06:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:50,867 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2019-01-14 19:06:50,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 19:06:50,868 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 82 [2019-01-14 19:06:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:50,870 INFO L225 Difference]: With dead ends: 155 [2019-01-14 19:06:50,871 INFO L226 Difference]: Without dead ends: 152 [2019-01-14 19:06:50,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-01-14 19:06:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-14 19:06:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2019-01-14 19:06:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 19:06:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2019-01-14 19:06:50,877 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 82 [2019-01-14 19:06:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:50,878 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2019-01-14 19:06:50,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 19:06:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2019-01-14 19:06:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-14 19:06:50,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:50,881 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:50,881 INFO L423 AbstractCegarLoop]: === Iteration 17 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-14 19:06:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash -311092151, now seen corresponding path program 2 times [2019-01-14 19:06:50,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:50,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:50,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-01-14 19:06:50,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:50,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:06:51,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:06:51,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 19:06:51,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:06:51,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:51,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:51,100 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 [2019-01-14 19:06:51,106 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 [2019-01-14 19:06:51,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:51,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:51,125 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. [2019-01-14 19:06:51,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-14 19:06:51,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:51,161 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 [2019-01-14 19:06:51,174 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 [2019-01-14 19:06:51,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:51,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:51,191 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. [2019-01-14 19:06:51,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-14 19:06:51,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:51,299 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 [2019-01-14 19:06:51,303 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 [2019-01-14 19:06:51,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:51,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:51,317 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. [2019-01-14 19:06:51,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-14 19:06:51,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:51,447 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 [2019-01-14 19:06:51,451 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 [2019-01-14 19:06:51,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:51,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:51,466 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. [2019-01-14 19:06:51,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-14 19:06:51,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:51,564 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 [2019-01-14 19:06:51,568 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 [2019-01-14 19:06:51,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:51,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:51,603 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. [2019-01-14 19:06:51,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-14 19:06:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2019-01-14 19:06:52,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:06:52,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2019-01-14 19:06:52,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 19:06:52,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 19:06:52,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2019-01-14 19:06:52,404 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 12 states. [2019-01-14 19:06:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:53,013 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2019-01-14 19:06:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 19:06:53,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2019-01-14 19:06:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:53,015 INFO L225 Difference]: With dead ends: 142 [2019-01-14 19:06:53,015 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 19:06:53,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 102 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=162, Invalid=437, Unknown=1, NotChecked=0, Total=600 [2019-01-14 19:06:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 19:06:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 19:06:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 19:06:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 19:06:53,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2019-01-14 19:06:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:53,019 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 19:06:53,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 19:06:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 19:06:53,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 19:06:53,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 07:06:53 BoogieIcfgContainer [2019-01-14 19:06:53,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 19:06:53,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 19:06:53,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 19:06:53,028 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 19:06:53,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:06:38" (3/4) ... [2019-01-14 19:06:53,034 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 19:06:53,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 19:06:53,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-01-14 19:06:53,042 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 19:06:53,048 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-01-14 19:06:53,048 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-14 19:06:53,048 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 19:06:53,048 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 19:06:53,097 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 19:06:53,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 19:06:53,099 INFO L168 Benchmark]: Toolchain (without parser) took 15182.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 951.3 MB in the beginning and 978.9 MB in the end (delta: -27.5 MB). Peak memory consumption was 280.2 MB. Max. memory is 11.5 GB. [2019-01-14 19:06:53,100 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-14 19:06:53,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.64 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. [2019-01-14 19:06:53,101 INFO L168 Benchmark]: Boogie Preprocessor took 53.40 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. [2019-01-14 19:06:53,103 INFO L168 Benchmark]: RCFGBuilder took 630.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 19:06:53,104 INFO L168 Benchmark]: TraceAbstraction took 14108.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 978.9 MB in the end (delta: 131.3 MB). Peak memory consumption was 296.9 MB. Max. memory is 11.5 GB. [2019-01-14 19:06:53,104 INFO L168 Benchmark]: Witness Printer took 69.34 ms. Allocated memory is still 1.3 GB. Free memory is still 978.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:06:53,109 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.15 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 315.64 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 53.40 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 630.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14108.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 978.9 MB in the end (delta: 131.3 MB). Peak memory consumption was 296.9 MB. Max. memory is 11.5 GB. * Witness Printer took 69.34 ms. Allocated memory is still 1.3 GB. Free memory is still 978.9 MB. There was no memory consumed. 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: 27]: 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 - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds 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, 14.0s OverallTime, 17 OverallIterations, 9 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 437 SDtfs, 1071 SDslu, 1228 SDs, 0 SdLazy, 2176 SolverSat, 237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 689 GetRequests, 501 SyntacticMatches, 27 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 227 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1145 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1115 ConstructedInterpolants, 152 QuantifiedInterpolants, 379260 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1660 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 1135/1320 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...