java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d4a2356 [2018-03-23 11:53:45,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-23 11:53:45,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-23 11:53:45,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-23 11:53:45,033 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-23 11:53:45,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-23 11:53:45,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-23 11:53:45,036 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-23 11:53:45,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-23 11:53:45,039 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-23 11:53:45,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-23 11:53:45,041 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-23 11:53:45,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-23 11:53:45,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-23 11:53:45,044 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-23 11:53:45,046 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-23 11:53:45,048 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-23 11:53:45,050 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-23 11:53:45,051 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-23 11:53:45,053 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-23 11:53:45,055 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-23 11:53:45,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-23 11:53:45,055 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-23 11:53:45,056 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-23 11:53:45,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-23 11:53:45,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-23 11:53:45,059 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-23 11:53:45,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-23 11:53:45,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-23 11:53:45,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-23 11:53:45,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-23 11:53:45,061 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-03-23 11:53:45,070 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-23 11:53:45,070 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-23 11:53:45,071 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-23 11:53:45,071 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-23 11:53:45,072 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-23 11:53:45,072 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-23 11:53:45,072 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-23 11:53:45,073 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-23 11:53:45,073 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-23 11:53:45,073 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-23 11:53:45,073 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-23 11:53:45,073 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-23 11:53:45,074 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-23 11:53:45,074 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-23 11:53:45,074 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-03-23 11:53:45,074 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-23 11:53:45,074 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-23 11:53:45,074 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-23 11:53:45,075 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-23 11:53:45,075 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-23 11:53:45,075 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-03-23 11:53:45,075 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-23 11:53:45,075 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-23 11:53:45,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 11:53:45,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-23 11:53:45,076 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-23 11:53:45,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-23 11:53:45,076 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-23 11:53:45,076 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-03-23 11:53:45,077 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-23 11:53:45,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-23 11:53:45,077 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-23 11:53:45,078 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-23 11:53:45,078 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-23 11:53:45,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-23 11:53:45,125 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-23 11:53:45,129 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-23 11:53:45,131 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-23 11:53:45,131 INFO L276 PluginConnector]: CDTParser initialized [2018-03-23 11:53:45,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-03-23 11:53:45,454 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG32b696c85 [2018-03-23 11:53:45,585 INFO L291 CDTParser]: IsIndexed: true [2018-03-23 11:53:45,585 INFO L292 CDTParser]: Found 1 translation units. [2018-03-23 11:53:45,585 INFO L171 CDTParser]: Scanning ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-03-23 11:53:45,586 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-23 11:53:45,587 INFO L215 ultiparseSymbolTable]: [2018-03-23 11:53:45,587 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-23 11:53:45,587 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-03-23 11:53:45,587 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo ('foo') in ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-03-23 11:53:45,587 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-23 11:53:45,587 INFO L233 ultiparseSymbolTable]: [2018-03-23 11:53:45,603 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG32b696c85 [2018-03-23 11:53:45,608 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-23 11:53:45,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-23 11:53:45,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-23 11:53:45,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-23 11:53:45,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-23 11:53:45,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:53:45" (1/1) ... [2018-03-23 11:53:45,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea0306f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:45, skipping insertion in model container [2018-03-23 11:53:45,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:53:45" (1/1) ... [2018-03-23 11:53:45,642 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:53:45,654 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:53:45,793 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:53:45,820 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:53:45,824 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-03-23 11:53:45,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:45 WrapperNode [2018-03-23 11:53:45,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-23 11:53:45,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-23 11:53:45,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-23 11:53:45,832 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-23 11:53:45,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:45" (1/1) ... [2018-03-23 11:53:45,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:45" (1/1) ... [2018-03-23 11:53:45,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:45" (1/1) ... [2018-03-23 11:53:45,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:45" (1/1) ... [2018-03-23 11:53:45,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:45" (1/1) ... [2018-03-23 11:53:45,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:45" (1/1) ... [2018-03-23 11:53:45,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:45" (1/1) ... [2018-03-23 11:53:45,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-23 11:53:45,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-23 11:53:45,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-23 11:53:45,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-23 11:53:45,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 11:53:45,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-23 11:53:45,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-23 11:53:45,918 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-03-23 11:53:45,918 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-23 11:53:45,918 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-03-23 11:53:45,918 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-23 11:53:45,918 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-23 11:53:45,918 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-23 11:53:45,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-23 11:53:45,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-23 11:53:45,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-23 11:53:45,919 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-23 11:53:45,919 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-23 11:53:46,169 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-23 11:53:46,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:53:46 BoogieIcfgContainer [2018-03-23 11:53:46,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-23 11:53:46,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-23 11:53:46,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-23 11:53:46,174 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-23 11:53:46,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 11:53:45" (1/3) ... [2018-03-23 11:53:46,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538bd179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:53:46, skipping insertion in model container [2018-03-23 11:53:46,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:45" (2/3) ... [2018-03-23 11:53:46,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538bd179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:53:46, skipping insertion in model container [2018-03-23 11:53:46,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:53:46" (3/3) ... [2018-03-23 11:53:46,176 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-03-23 11:53:46,183 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-23 11:53:46,189 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-03-23 11:53:46,229 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-23 11:53:46,230 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-23 11:53:46,230 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-23 11:53:46,230 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-23 11:53:46,230 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-23 11:53:46,231 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-23 11:53:46,231 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-23 11:53:46,231 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-23 11:53:46,231 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-23 11:53:46,232 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-23 11:53:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-03-23 11:53:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-03-23 11:53:46,256 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:46,256 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:46,256 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:46,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1751798805, now seen corresponding path program 1 times [2018-03-23 11:53:46,261 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:46,261 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:46,297 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:46,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:46,297 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:46,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:46,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:46,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 11:53:46,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 11:53:46,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 11:53:46,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:53:46,434 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2018-03-23 11:53:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:46,523 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2018-03-23 11:53:46,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 11:53:46,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-03-23 11:53:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:46,535 INFO L225 Difference]: With dead ends: 138 [2018-03-23 11:53:46,535 INFO L226 Difference]: Without dead ends: 82 [2018-03-23 11:53:46,538 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:53:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-03-23 11:53:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-03-23 11:53:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-03-23 11:53:46,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-03-23 11:53:46,573 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 16 [2018-03-23 11:53:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:46,573 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-03-23 11:53:46,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 11:53:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-03-23 11:53:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-23 11:53:46,574 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:46,574 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:46,574 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash -177512800, now seen corresponding path program 1 times [2018-03-23 11:53:46,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:46,575 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:46,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:46,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:46,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:46,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:46,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:46,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 11:53:46,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 11:53:46,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 11:53:46,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:53:46,633 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 3 states. [2018-03-23 11:53:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:46,669 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-03-23 11:53:46,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 11:53:46,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-03-23 11:53:46,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:46,673 INFO L225 Difference]: With dead ends: 82 [2018-03-23 11:53:46,673 INFO L226 Difference]: Without dead ends: 81 [2018-03-23 11:53:46,674 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:53:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-03-23 11:53:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2018-03-23 11:53:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-03-23 11:53:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-03-23 11:53:46,683 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-03-23 11:53:46,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:46,684 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-03-23 11:53:46,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 11:53:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-03-23 11:53:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-03-23 11:53:46,685 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:46,685 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:46,685 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:46,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1207929453, now seen corresponding path program 1 times [2018-03-23 11:53:46,685 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:46,685 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:46,686 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:46,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:46,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:46,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:46,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:46,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 11:53:46,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 11:53:46,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 11:53:46,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-23 11:53:46,789 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-03-23 11:53:46,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:46,894 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-03-23 11:53:46,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:53:46,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-03-23 11:53:46,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:46,895 INFO L225 Difference]: With dead ends: 71 [2018-03-23 11:53:46,896 INFO L226 Difference]: Without dead ends: 70 [2018-03-23 11:53:46,896 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:53:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-03-23 11:53:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-03-23 11:53:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-03-23 11:53:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-03-23 11:53:46,902 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 26 [2018-03-23 11:53:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:46,902 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-03-23 11:53:46,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 11:53:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-03-23 11:53:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-03-23 11:53:46,903 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:46,903 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:46,903 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1207929452, now seen corresponding path program 1 times [2018-03-23 11:53:46,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:46,903 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:46,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:46,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:46,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:46,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:47,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:47,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-03-23 11:53:47,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-23 11:53:47,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-23 11:53:47,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-03-23 11:53:47,044 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 7 states. [2018-03-23 11:53:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:47,203 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-03-23 11:53:47,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-23 11:53:47,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-03-23 11:53:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:47,204 INFO L225 Difference]: With dead ends: 79 [2018-03-23 11:53:47,204 INFO L226 Difference]: Without dead ends: 78 [2018-03-23 11:53:47,205 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-03-23 11:53:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-03-23 11:53:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2018-03-23 11:53:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-03-23 11:53:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-03-23 11:53:47,212 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2018-03-23 11:53:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:47,212 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-03-23 11:53:47,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-23 11:53:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-03-23 11:53:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-03-23 11:53:47,213 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:47,213 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:47,213 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:47,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1743777157, now seen corresponding path program 1 times [2018-03-23 11:53:47,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:47,214 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:47,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:47,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:47,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:47,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:47,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:47,292 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:47,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:47,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:47,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:47,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-03-23 11:53:47,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:53:47,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:53:47,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:53:47,398 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2018-03-23 11:53:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:47,497 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-03-23 11:53:47,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:53:47,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-03-23 11:53:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:47,499 INFO L225 Difference]: With dead ends: 92 [2018-03-23 11:53:47,499 INFO L226 Difference]: Without dead ends: 91 [2018-03-23 11:53:47,499 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-03-23 11:53:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-03-23 11:53:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-03-23 11:53:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-03-23 11:53:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-03-23 11:53:47,510 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 34 [2018-03-23 11:53:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:47,510 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-03-23 11:53:47,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:53:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-03-23 11:53:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-03-23 11:53:47,511 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:47,512 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:47,512 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:47,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1777482929, now seen corresponding path program 1 times [2018-03-23 11:53:47,512 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:47,512 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:47,513 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:47,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:47,513 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:47,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:47,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:47,685 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:47,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:47,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:47,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:53:47,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:47,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:47,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:53:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:47,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:47,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-03-23 11:53:47,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 11:53:47,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 11:53:47,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:53:47,883 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 9 states. [2018-03-23 11:53:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:48,163 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-03-23 11:53:48,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-23 11:53:48,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-03-23 11:53:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:48,165 INFO L225 Difference]: With dead ends: 91 [2018-03-23 11:53:48,165 INFO L226 Difference]: Without dead ends: 90 [2018-03-23 11:53:48,166 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-03-23 11:53:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-03-23 11:53:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2018-03-23 11:53:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-03-23 11:53:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-03-23 11:53:48,175 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 35 [2018-03-23 11:53:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:48,176 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-03-23 11:53:48,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 11:53:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-03-23 11:53:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-03-23 11:53:48,177 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:48,177 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:48,178 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:48,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1833243520, now seen corresponding path program 1 times [2018-03-23 11:53:48,178 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:48,179 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:48,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:48,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:48,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:48,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:48,257 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:48,257 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:48,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:48,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:48,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:53:48,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-03-23 11:53:48,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 11:53:48,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 11:53:48,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:53:48,351 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 9 states. [2018-03-23 11:53:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:48,553 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2018-03-23 11:53:48,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-23 11:53:48,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-03-23 11:53:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:48,555 INFO L225 Difference]: With dead ends: 174 [2018-03-23 11:53:48,555 INFO L226 Difference]: Without dead ends: 107 [2018-03-23 11:53:48,556 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-03-23 11:53:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-03-23 11:53:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2018-03-23 11:53:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-03-23 11:53:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-03-23 11:53:48,568 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 37 [2018-03-23 11:53:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:48,569 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-03-23 11:53:48,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 11:53:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-03-23 11:53:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-03-23 11:53:48,571 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:48,571 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:48,572 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:48,572 INFO L82 PathProgramCache]: Analyzing trace with hash -866299840, now seen corresponding path program 2 times [2018-03-23 11:53:48,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:48,572 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:48,573 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:48,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:48,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:48,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:48,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:48,709 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:48,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:48,751 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:48,751 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:48,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-03-23 11:53:49,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:49,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 15 [2018-03-23 11:53:49,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-03-23 11:53:49,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-03-23 11:53:49,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-03-23 11:53:49,018 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 16 states. [2018-03-23 11:53:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:49,389 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-03-23 11:53:49,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-03-23 11:53:49,389 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-03-23 11:53:49,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:49,390 INFO L225 Difference]: With dead ends: 111 [2018-03-23 11:53:49,390 INFO L226 Difference]: Without dead ends: 110 [2018-03-23 11:53:49,391 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2018-03-23 11:53:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-03-23 11:53:49,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2018-03-23 11:53:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-03-23 11:53:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-03-23 11:53:49,398 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 43 [2018-03-23 11:53:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:49,399 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-03-23 11:53:49,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-03-23 11:53:49,399 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-03-23 11:53:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-03-23 11:53:49,400 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:49,400 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:49,400 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:49,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1085491212, now seen corresponding path program 2 times [2018-03-23 11:53:49,401 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:49,401 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:49,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:49,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:49,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:49,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:49,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:49,672 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:49,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:49,694 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:49,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:49,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:49,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:53:49,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:49,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:49,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:53:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:49,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:49,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-03-23 11:53:49,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-23 11:53:49,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-23 11:53:49,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-03-23 11:53:49,803 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 11 states. [2018-03-23 11:53:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:50,076 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-03-23 11:53:50,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-23 11:53:50,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-03-23 11:53:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:50,078 INFO L225 Difference]: With dead ends: 110 [2018-03-23 11:53:50,078 INFO L226 Difference]: Without dead ends: 109 [2018-03-23 11:53:50,078 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-03-23 11:53:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-03-23 11:53:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2018-03-23 11:53:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-03-23 11:53:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-03-23 11:53:50,086 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 44 [2018-03-23 11:53:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:50,087 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-03-23 11:53:50,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-23 11:53:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-03-23 11:53:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-23 11:53:50,088 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:50,088 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:50,088 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1896469265, now seen corresponding path program 3 times [2018-03-23 11:53:50,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:50,088 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:50,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:50,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:50,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:50,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:50,396 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:50,396 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:50,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 11:53:50,424 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-03-23 11:53:50,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:50,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:50,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:53:50,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:50,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:50,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:53:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-03-23 11:53:50,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:50,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2018-03-23 11:53:50,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-03-23 11:53:50,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-03-23 11:53:50,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-03-23 11:53:50,600 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 24 states. [2018-03-23 11:53:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:51,260 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2018-03-23 11:53:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-03-23 11:53:51,260 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-03-23 11:53:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:51,261 INFO L225 Difference]: With dead ends: 184 [2018-03-23 11:53:51,261 INFO L226 Difference]: Without dead ends: 102 [2018-03-23 11:53:51,262 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=337, Invalid=1223, Unknown=0, NotChecked=0, Total=1560 [2018-03-23 11:53:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-03-23 11:53:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2018-03-23 11:53:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-23 11:53:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-03-23 11:53:51,270 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 53 [2018-03-23 11:53:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:51,270 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-03-23 11:53:51,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-03-23 11:53:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-03-23 11:53:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-03-23 11:53:51,271 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:51,272 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:51,272 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:51,272 INFO L82 PathProgramCache]: Analyzing trace with hash -416134581, now seen corresponding path program 1 times [2018-03-23 11:53:51,272 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:51,272 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:51,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:51,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:51,273 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:51,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-03-23 11:53:51,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:51,457 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:51,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:51,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 63 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-03-23 11:53:51,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:51,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-03-23 11:53:51,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-03-23 11:53:51,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-03-23 11:53:51,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-03-23 11:53:51,598 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 16 states. [2018-03-23 11:53:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:51,828 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-03-23 11:53:51,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-23 11:53:51,829 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2018-03-23 11:53:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:51,830 INFO L225 Difference]: With dead ends: 175 [2018-03-23 11:53:51,830 INFO L226 Difference]: Without dead ends: 102 [2018-03-23 11:53:51,831 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-03-23 11:53:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-03-23 11:53:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2018-03-23 11:53:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-23 11:53:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-03-23 11:53:51,838 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 94 [2018-03-23 11:53:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:51,839 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-03-23 11:53:51,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-03-23 11:53:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-03-23 11:53:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-03-23 11:53:51,840 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:51,840 INFO L353 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:51,840 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1046721695, now seen corresponding path program 2 times [2018-03-23 11:53:51,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:51,840 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:51,841 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:51,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:51,841 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:51,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-03-23 11:53:51,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:51,959 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-03-23 11:53:51,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:51,998 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:51,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:52,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 112 proven. 33 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-03-23 11:53:52,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:52,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 17 [2018-03-23 11:53:52,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-03-23 11:53:52,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-03-23 11:53:52,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-03-23 11:53:52,139 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 17 states. [2018-03-23 11:53:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:52,370 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2018-03-23 11:53:52,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-03-23 11:53:52,370 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2018-03-23 11:53:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:52,371 INFO L225 Difference]: With dead ends: 208 [2018-03-23 11:53:52,372 INFO L226 Difference]: Without dead ends: 126 [2018-03-23 11:53:52,372 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2018-03-23 11:53:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-03-23 11:53:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2018-03-23 11:53:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-03-23 11:53:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-03-23 11:53:52,379 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 112 [2018-03-23 11:53:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:52,380 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-03-23 11:53:52,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-03-23 11:53:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-03-23 11:53:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-03-23 11:53:52,382 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:52,382 INFO L353 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:52,382 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:52,382 INFO L82 PathProgramCache]: Analyzing trace with hash -322904113, now seen corresponding path program 1 times [2018-03-23 11:53:52,382 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:52,382 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:52,383 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:52,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:52,383 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:52,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-03-23 11:53:52,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:52,526 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-03-23 11:53:52,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:52,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 177 proven. 62 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-03-23 11:53:52,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:52,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 18 [2018-03-23 11:53:52,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-23 11:53:52,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-23 11:53:52,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-03-23 11:53:52,761 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 18 states. [2018-03-23 11:53:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:53,000 INFO L93 Difference]: Finished difference Result 232 states and 246 transitions. [2018-03-23 11:53:53,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-23 11:53:53,000 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 137 [2018-03-23 11:53:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:53,001 INFO L225 Difference]: With dead ends: 232 [2018-03-23 11:53:53,001 INFO L226 Difference]: Without dead ends: 144 [2018-03-23 11:53:53,002 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2018-03-23 11:53:53,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-03-23 11:53:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 122. [2018-03-23 11:53:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-03-23 11:53:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-03-23 11:53:53,010 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 137 [2018-03-23 11:53:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:53,011 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-03-23 11:53:53,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-23 11:53:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-03-23 11:53:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-03-23 11:53:53,012 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:53,012 INFO L353 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 15, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:53,013 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1185853185, now seen corresponding path program 2 times [2018-03-23 11:53:53,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:53,013 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:53,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:53,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:53,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:53,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 1065 trivial. 0 not checked. [2018-03-23 11:53:53,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:53,159 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-03-23 11:53:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:53,178 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-03-23 11:53:53,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:53,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:53,203 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:53,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:53:53,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:53,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:53,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:53:53,307 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:53,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:53:53,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:53,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:53,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:53:53,389 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:53,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:53:53,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:53,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:53,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:53:53,494 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~0.base| Int)) (and (= (store |c_old(#valid)| |main_~#mask~0.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#mask~0.base|) 0))) is different from true [2018-03-23 11:53:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-03-23 11:53:53,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:53:53,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-03-23 11:53:53,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-23 11:53:53,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-23 11:53:53,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2018-03-23 11:53:53,671 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 13 states. [2018-03-23 11:53:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:54,012 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-03-23 11:53:54,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-03-23 11:53:54,012 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 221 [2018-03-23 11:53:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:54,013 INFO L225 Difference]: With dead ends: 168 [2018-03-23 11:53:54,013 INFO L226 Difference]: Without dead ends: 136 [2018-03-23 11:53:54,014 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 214 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=442, Unknown=1, NotChecked=46, Total=650 [2018-03-23 11:53:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-03-23 11:53:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2018-03-23 11:53:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-03-23 11:53:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-03-23 11:53:54,025 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 221 [2018-03-23 11:53:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:54,025 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-03-23 11:53:54,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-23 11:53:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-03-23 11:53:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-03-23 11:53:54,028 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:54,028 INFO L353 BasicCegarLoop]: trace histogram [24, 20, 20, 20, 20, 20, 20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:54,028 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:54,028 INFO L82 PathProgramCache]: Analyzing trace with hash -494506643, now seen corresponding path program 1 times [2018-03-23 11:53:54,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:54,029 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:54,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:54,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:54,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:54,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2007 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2004 trivial. 0 not checked. [2018-03-23 11:53:54,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:54,207 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-03-23 11:53:54,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:54,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2007 backedges. 782 proven. 100 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2018-03-23 11:53:54,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:54,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15] total 19 [2018-03-23 11:53:54,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-23 11:53:54,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-23 11:53:54,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-03-23 11:53:54,499 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 19 states. [2018-03-23 11:53:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:54,733 INFO L93 Difference]: Finished difference Result 261 states and 275 transitions. [2018-03-23 11:53:54,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-03-23 11:53:54,733 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 289 [2018-03-23 11:53:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:54,734 INFO L225 Difference]: With dead ends: 261 [2018-03-23 11:53:54,734 INFO L226 Difference]: Without dead ends: 150 [2018-03-23 11:53:54,735 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=766, Unknown=0, NotChecked=0, Total=992 [2018-03-23 11:53:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-03-23 11:53:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2018-03-23 11:53:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-03-23 11:53:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-03-23 11:53:54,745 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 289 [2018-03-23 11:53:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:54,746 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-03-23 11:53:54,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-23 11:53:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-03-23 11:53:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-03-23 11:53:54,748 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:54,749 INFO L353 BasicCegarLoop]: trace histogram [28, 24, 24, 24, 24, 24, 24, 24, 24, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:54,749 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1127706925, now seen corresponding path program 2 times [2018-03-23 11:53:54,749 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:54,749 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:54,750 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:54,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:54,750 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:54,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2823 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2810 trivial. 0 not checked. [2018-03-23 11:53:55,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:55,002 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-03-23 11:53:55,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:55,066 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:55,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:55,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2823 backedges. 1091 proven. 147 refuted. 0 times theorem prover too weak. 1585 trivial. 0 not checked. [2018-03-23 11:53:55,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:55,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 23 [2018-03-23 11:53:55,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-03-23 11:53:55,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-03-23 11:53:55,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-03-23 11:53:55,402 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 23 states. [2018-03-23 11:53:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:55,747 INFO L93 Difference]: Finished difference Result 285 states and 299 transitions. [2018-03-23 11:53:55,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-03-23 11:53:55,771 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 332 [2018-03-23 11:53:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:55,771 INFO L225 Difference]: With dead ends: 285 [2018-03-23 11:53:55,771 INFO L226 Difference]: Without dead ends: 0 [2018-03-23 11:53:55,772 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=1322, Unknown=0, NotChecked=0, Total=1640 [2018-03-23 11:53:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-03-23 11:53:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-03-23 11:53:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-03-23 11:53:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-03-23 11:53:55,773 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 332 [2018-03-23 11:53:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:55,773 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-03-23 11:53:55,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-03-23 11:53:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-03-23 11:53:55,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-03-23 11:53:55,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-03-23 11:53:56,254 WARN L151 SmtUtils]: Spent 306ms on a formula simplification. DAG size of input: 39 DAG size of output 28 [2018-03-23 11:53:56,563 WARN L151 SmtUtils]: Spent 308ms on a formula simplification. DAG size of input: 48 DAG size of output 29 [2018-03-23 11:53:56,813 WARN L151 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 77 DAG size of output 35 [2018-03-23 11:53:56,890 INFO L416 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-03-23 11:53:56,890 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-03-23 11:53:56,890 INFO L412 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-03-23 11:53:56,890 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-03-23 11:53:56,890 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-03-23 11:53:56,890 INFO L416 ceAbstractionStarter]: For program point L15''''(line 15) no Hoare annotation was computed. [2018-03-23 11:53:56,890 INFO L412 ceAbstractionStarter]: At program point L15''''''(lines 15 17) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base))) (.cse1 (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset 0)) (.cse2 (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size)) (.cse3 (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~size 32)) (.cse4 (= 32 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.base)))) (or (not (= 32 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~size|)) (not (= 1 (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base|))) (and .cse0 .cse1 .cse2 (<= 1 (+ __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~b.offset __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0)) .cse3 .cse4) (and .cse0 .cse1 .cse2 (= 0 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_~i~0) .cse3 .cse4) (not (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.offset|)) (not (= 32 (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo_#in~b.base|))))) [2018-03-23 11:53:56,890 INFO L416 ceAbstractionStarter]: For program point L15'''''''(lines 15 17) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point L16'''(line 16) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point L15'(lines 15 17) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation(line 16) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point L15'''''(line 15) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation(line 16) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point L15'''(lines 15 17) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-03-23 11:53:56,891 INFO L419 ceAbstractionStarter]: At program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooENTRY(lines 12 19) the Hoare annotation is: true [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX(line 16) no Hoare annotation was computed. [2018-03-23 11:53:56,892 INFO L419 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-03-23 11:53:56,892 INFO L419 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point mainErr2EnsuresViolationMEMORY_LEAK(lines 21 35) no Hoare annotation was computed. [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point mainErr1AssertViolationARRAY_INDEX(line 30) no Hoare annotation was computed. [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-03-23 11:53:56,892 INFO L416 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-03-23 11:53:56,893 INFO L416 ceAbstractionStarter]: For program point L27''''(line 27) no Hoare annotation was computed. [2018-03-23 11:53:56,893 INFO L412 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse1 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse0 (= 1 (select |#valid| main_~c~0.base))) (.cse2 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse3 (= 0 |main_~#mask~0.offset|)) (.cse4 (= 32 (select |#length| main_~c~0.base))) (.cse5 (= 0 main_~c~0.offset)) (.cse6 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and .cse0 (= 0 main_~i~1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (and .cse0 .cse2 .cse3 (<= 1 main_~i~1) .cse4 .cse5) .cse6))) [2018-03-23 11:53:56,893 INFO L416 ceAbstractionStarter]: For program point L27'''(line 27) no Hoare annotation was computed. [2018-03-23 11:53:56,893 INFO L416 ceAbstractionStarter]: For program point L29''''''(lines 29 33) no Hoare annotation was computed. [2018-03-23 11:53:56,893 INFO L416 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-03-23 11:53:56,893 INFO L416 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-03-23 11:53:56,893 INFO L416 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-03-23 11:53:56,893 INFO L416 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-03-23 11:53:56,893 INFO L416 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-03-23 11:53:56,893 INFO L412 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-03-23 11:53:56,894 INFO L416 ceAbstractionStarter]: For program point L29''''(line 29) no Hoare annotation was computed. [2018-03-23 11:53:56,894 INFO L416 ceAbstractionStarter]: For program point L25'''''''(lines 25 28) no Hoare annotation was computed. [2018-03-23 11:53:56,894 INFO L416 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-03-23 11:53:56,894 INFO L416 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-03-23 11:53:56,894 INFO L416 ceAbstractionStarter]: For program point mainErr0AssertViolationARRAY_INDEX(line 27) no Hoare annotation was computed. [2018-03-23 11:53:56,894 INFO L416 ceAbstractionStarter]: For program point L25'''(lines 25 28) no Hoare annotation was computed. [2018-03-23 11:53:56,894 INFO L416 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-03-23 11:53:56,894 INFO L412 ceAbstractionStarter]: At program point L25''''''(lines 25 28) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse1 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse2 (= 0 |main_~#mask~0.offset|)) (.cse3 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and .cse0 .cse1 (<= 1 main_~i~1) (= 1 (select |#valid| main_~c~0.base)) .cse2 (= 32 (select |#length| main_~c~0.base)) (= 0 main_~c~0.offset) .cse3) (and .cse0 .cse1 .cse2 (= main_~i~1 0) .cse3))) [2018-03-23 11:53:56,894 INFO L416 ceAbstractionStarter]: For program point L25'(lines 25 28) no Hoare annotation was computed. [2018-03-23 11:53:56,894 INFO L416 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-03-23 11:53:56,894 INFO L416 ceAbstractionStarter]: For program point L29'''(line 29) no Hoare annotation was computed. [2018-03-23 11:53:56,894 INFO L416 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-03-23 11:53:56,895 INFO L416 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-03-23 11:53:56,895 INFO L416 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-03-23 11:53:56,895 INFO L416 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-03-23 11:53:56,895 INFO L412 ceAbstractionStarter]: At program point L29'''''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~0.base))) (.cse1 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse2 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse3 (= 0 |main_~#mask~0.offset|)) (.cse4 (= 32 (select |#length| main_~c~0.base))) (.cse5 (= 0 main_~c~0.offset)) (.cse6 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 main_~i~1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~i~1 0) .cse5 .cse6))) [2018-03-23 11:53:56,895 INFO L416 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-03-23 11:53:56,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,907 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,907 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,907 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,909 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 11:53:56 BoogieIcfgContainer [2018-03-23 11:53:56,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-23 11:53:56,917 INFO L168 Benchmark]: Toolchain (without parser) took 11308.59 ms. Allocated memory was 300.9 MB in the beginning and 675.8 MB in the end (delta: 374.9 MB). Free memory was 245.1 MB in the beginning and 572.2 MB in the end (delta: -327.0 MB). Peak memory consumption was 282.9 MB. Max. memory is 5.3 GB. [2018-03-23 11:53:56,918 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 300.9 MB. Free memory is still 265.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-23 11:53:56,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.09 ms. Allocated memory is still 300.9 MB. Free memory was 244.2 MB in the beginning and 235.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 5.3 GB. [2018-03-23 11:53:56,919 INFO L168 Benchmark]: Boogie Preprocessor took 30.95 ms. Allocated memory is still 300.9 MB. Free memory was 235.2 MB in the beginning and 233.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-03-23 11:53:56,920 INFO L168 Benchmark]: RCFGBuilder took 306.48 ms. Allocated memory was 300.9 MB in the beginning and 457.2 MB in the end (delta: 156.2 MB). Free memory was 233.1 MB in the beginning and 422.6 MB in the end (delta: -189.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. [2018-03-23 11:53:56,920 INFO L168 Benchmark]: TraceAbstraction took 10745.26 ms. Allocated memory was 457.2 MB in the beginning and 675.8 MB in the end (delta: 218.6 MB). Free memory was 422.6 MB in the beginning and 572.2 MB in the end (delta: -149.6 MB). Peak memory consumption was 304.1 MB. Max. memory is 5.3 GB. [2018-03-23 11:53:56,922 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 300.9 MB. Free memory is still 265.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.09 ms. Allocated memory is still 300.9 MB. Free memory was 244.2 MB in the beginning and 235.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.95 ms. Allocated memory is still 300.9 MB. Free memory was 235.2 MB in the beginning and 233.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 306.48 ms. Allocated memory was 300.9 MB in the beginning and 457.2 MB in the end (delta: 156.2 MB). Free memory was 233.1 MB in the beginning and 422.6 MB in the end (delta: -189.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10745.26 ms. Allocated memory was 457.2 MB in the beginning and 675.8 MB in the end (delta: 218.6 MB). Free memory was 422.6 MB in the beginning and 572.2 MB in the end (delta: -149.6 MB). Peak memory consumption was 304.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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]: 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: 30]: array index is always in bounds For all program executions holds that array index is always in bounds 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]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2018-03-23 11:53:56,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((\valid == \old(\valid)[mask := 1] && 32 == unknown-#length-unknown[mask]) && 1 <= i) && 1 == \valid[c]) && 0 == mask) && 32 == unknown-#length-unknown[c]) && 0 == c) && \old(\valid)[mask] == 0) || ((((\valid == \old(\valid)[mask := 1] && 32 == unknown-#length-unknown[mask]) && 0 == mask) && i == 0) && \old(\valid)[mask] == 0) - InvariantResult [Line: 15]: Loop Invariant [2018-03-23 11:53:56,931 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,931 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,931 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,932 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,933 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,933 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(32 == \old(size)) || !(1 == \valid[b])) || (((((1 == \valid[b] && b == 0) && \old(size) <= size) && 1 <= b + i) && size <= 32) && 32 == unknown-#length-unknown[b])) || (((((1 == \valid[b] && b == 0) && \old(size) <= size) && 0 == i) && size <= 32) && 32 == unknown-#length-unknown[b])) || !(0 == b)) || !(32 == unknown-#length-unknown[b]) - InvariantResult [Line: 29]: Loop Invariant [2018-03-23 11:53:56,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:56,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[c] && \valid == \old(\valid)[mask := 1]) && 32 == unknown-#length-unknown[mask]) && 0 == mask) && 1 <= i) && 32 == unknown-#length-unknown[c]) && 0 == c) && \old(\valid)[mask] == 0) || (((((((1 == \valid[c] && \valid == \old(\valid)[mask := 1]) && 32 == unknown-#length-unknown[mask]) && 0 == mask) && 32 == unknown-#length-unknown[c]) && i == 0) && 0 == c) && \old(\valid)[mask] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 6 error locations. SAFE Result, 10.6s OverallTime, 16 OverallIterations, 28 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 861 SDtfs, 1690 SDslu, 4154 SDs, 0 SdLazy, 2513 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1665 GetRequests, 1343 SyntacticMatches, 21 SemanticMatches, 301 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=15, 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, 16 MinimizatonAttempts, 186 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 39 PreInvPairs, 79 NumberOfFragments, 285 HoareAnnotationTreeSize, 39 FomulaSimplifications, 2532 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1918 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2955 NumberOfCodeBlocks, 2739 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2927 ConstructedInterpolants, 167 QuantifiedInterpolants, 1349448 SizeOfPredicates, 84 NumberOfNonLiveVariables, 2409 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 12615/13224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-23_11-53-56-943.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-23_11-53-56-943.csv Received shutdown request...