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/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d4a2356 [2018-03-23 11:53:16,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-23 11:53:16,095 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-23 11:53:16,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-23 11:53:16,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-23 11:53:16,111 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-23 11:53:16,112 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-23 11:53:16,114 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-23 11:53:16,117 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-23 11:53:16,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-23 11:53:16,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-23 11:53:16,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-23 11:53:16,120 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-23 11:53:16,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-23 11:53:16,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-23 11:53:16,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-23 11:53:16,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-23 11:53:16,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-23 11:53:16,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-23 11:53:16,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-23 11:53:16,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-23 11:53:16,136 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-23 11:53:16,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-23 11:53:16,137 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-23 11:53:16,138 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-23 11:53:16,139 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-23 11:53:16,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-23 11:53:16,140 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-23 11:53:16,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-23 11:53:16,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-23 11:53:16,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-23 11:53:16,143 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:16,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-23 11:53:16,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-23 11:53:16,153 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-23 11:53:16,154 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-23 11:53:16,154 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-23 11:53:16,154 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-23 11:53:16,154 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-23 11:53:16,155 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-23 11:53:16,155 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-23 11:53:16,155 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-23 11:53:16,155 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-23 11:53:16,156 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-23 11:53:16,156 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-23 11:53:16,156 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-23 11:53:16,156 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-03-23 11:53:16,156 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-23 11:53:16,157 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-23 11:53:16,157 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-23 11:53:16,157 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-23 11:53:16,157 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-23 11:53:16,157 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-03-23 11:53:16,158 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-23 11:53:16,158 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-23 11:53:16,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 11:53:16,158 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-23 11:53:16,159 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-23 11:53:16,159 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-23 11:53:16,159 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-23 11:53:16,159 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-03-23 11:53:16,159 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-23 11:53:16,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-23 11:53:16,160 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-23 11:53:16,161 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-23 11:53:16,161 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-23 11:53:16,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-23 11:53:16,211 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-23 11:53:16,216 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-23 11:53:16,218 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-23 11:53:16,218 INFO L276 PluginConnector]: CDTParser initialized [2018-03-23 11:53:16,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-03-23 11:53:16,542 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG94b532572 [2018-03-23 11:53:16,661 INFO L291 CDTParser]: IsIndexed: true [2018-03-23 11:53:16,661 INFO L292 CDTParser]: Found 1 translation units. [2018-03-23 11:53:16,661 INFO L171 CDTParser]: Scanning ArraysOfVariableLength2_true-valid-memsafety.c [2018-03-23 11:53:16,662 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-23 11:53:16,662 INFO L215 ultiparseSymbolTable]: [2018-03-23 11:53:16,662 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-23 11:53:16,663 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-03-23 11:53:16,663 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-03-23 11:53:16,663 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar ('bar') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-03-23 11:53:16,663 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-23 11:53:16,663 INFO L233 ultiparseSymbolTable]: [2018-03-23 11:53:16,677 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG94b532572 [2018-03-23 11:53:16,681 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-23 11:53:16,683 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-23 11:53:16,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-23 11:53:16,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-23 11:53:16,688 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-23 11:53:16,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:53:16" (1/1) ... [2018-03-23 11:53:16,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b430b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:16, skipping insertion in model container [2018-03-23 11:53:16,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:53:16" (1/1) ... [2018-03-23 11:53:16,704 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:53:16,715 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:53:16,843 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:53:16,868 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:53:16,873 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 10 non ball SCCs. Number of states in SCCs 10. [2018-03-23 11:53:16,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:16 WrapperNode [2018-03-23 11:53:16,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-23 11:53:16,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-23 11:53:16,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-23 11:53:16,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-23 11:53:16,894 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:16" (1/1) ... [2018-03-23 11:53:16,894 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:16" (1/1) ... [2018-03-23 11:53:16,903 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:16" (1/1) ... [2018-03-23 11:53:16,903 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:16" (1/1) ... [2018-03-23 11:53:16,909 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:16" (1/1) ... [2018-03-23 11:53:16,914 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:16" (1/1) ... [2018-03-23 11:53:16,915 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:16" (1/1) ... [2018-03-23 11:53:16,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-23 11:53:16,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-23 11:53:16,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-23 11:53:16,919 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-23 11:53:16,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:16" (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:16,965 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-23 11:53:16,966 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-23 11:53:16,966 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-03-23 11:53:16,966 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-03-23 11:53:16,966 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-23 11:53:16,966 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-03-23 11:53:16,966 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-23 11:53:16,967 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-03-23 11:53:16,967 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-23 11:53:16,967 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-23 11:53:16,967 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-23 11:53:16,968 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-23 11:53:16,968 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-23 11:53:16,968 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-23 11:53:16,968 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-23 11:53:17,323 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-23 11:53:17,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:53:17 BoogieIcfgContainer [2018-03-23 11:53:17,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-23 11:53:17,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-23 11:53:17,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-23 11:53:17,327 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-23 11:53:17,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 11:53:16" (1/3) ... [2018-03-23 11:53:17,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1879e71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:53:17, skipping insertion in model container [2018-03-23 11:53:17,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:16" (2/3) ... [2018-03-23 11:53:17,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1879e71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:53:17, skipping insertion in model container [2018-03-23 11:53:17,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:53:17" (3/3) ... [2018-03-23 11:53:17,331 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-03-23 11:53:17,341 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-23 11:53:17,349 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-03-23 11:53:17,385 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-23 11:53:17,386 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-23 11:53:17,386 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-23 11:53:17,386 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-23 11:53:17,386 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-23 11:53:17,387 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-23 11:53:17,387 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-23 11:53:17,387 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-23 11:53:17,387 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-23 11:53:17,388 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-23 11:53:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-03-23 11:53:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-03-23 11:53:17,415 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:17,416 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:17,416 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:17,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1517835154, now seen corresponding path program 1 times [2018-03-23 11:53:17,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:17,421 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:17,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:17,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:17,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:17,498 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:17,520 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:17,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:17,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 11:53:17,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-03-23 11:53:17,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-03-23 11:53:17,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-03-23 11:53:17,537 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2018-03-23 11:53:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:17,568 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2018-03-23 11:53:17,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-03-23 11:53:17,570 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-03-23 11:53:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:17,580 INFO L225 Difference]: With dead ends: 169 [2018-03-23 11:53:17,580 INFO L226 Difference]: Without dead ends: 86 [2018-03-23 11:53:17,584 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-03-23 11:53:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-03-23 11:53:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-03-23 11:53:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-03-23 11:53:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-03-23 11:53:17,618 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 14 [2018-03-23 11:53:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:17,618 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-03-23 11:53:17,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-03-23 11:53:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-03-23 11:53:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-03-23 11:53:17,619 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:17,619 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:17,620 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:17,620 INFO L82 PathProgramCache]: Analyzing trace with hash -693346302, now seen corresponding path program 1 times [2018-03-23 11:53:17,620 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:17,620 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:17,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:17,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:17,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:17,638 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:17,675 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:17,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:17,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 11:53:17,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 11:53:17,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 11:53:17,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:53:17,678 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 3 states. [2018-03-23 11:53:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:17,757 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-03-23 11:53:17,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 11:53:17,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-03-23 11:53:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:17,760 INFO L225 Difference]: With dead ends: 110 [2018-03-23 11:53:17,761 INFO L226 Difference]: Without dead ends: 93 [2018-03-23 11:53:17,761 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:53:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-03-23 11:53:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-03-23 11:53:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-03-23 11:53:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-03-23 11:53:17,774 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 15 [2018-03-23 11:53:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:17,775 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-03-23 11:53:17,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 11:53:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-03-23 11:53:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-23 11:53:17,775 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:17,776 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] [2018-03-23 11:53:17,776 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1457275385, now seen corresponding path program 1 times [2018-03-23 11:53:17,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:17,776 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:17,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:17,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:17,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:17,804 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:17,901 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:17,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:17,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-03-23 11:53:17,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 11:53:17,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 11:53:17,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-03-23 11:53:17,903 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 6 states. [2018-03-23 11:53:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:18,002 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2018-03-23 11:53:18,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:53:18,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-23 11:53:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:18,003 INFO L225 Difference]: With dead ends: 188 [2018-03-23 11:53:18,004 INFO L226 Difference]: Without dead ends: 114 [2018-03-23 11:53:18,004 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:53:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-03-23 11:53:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2018-03-23 11:53:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-03-23 11:53:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-03-23 11:53:18,013 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 21 [2018-03-23 11:53:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:18,013 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-03-23 11:53:18,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 11:53:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-03-23 11:53:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-03-23 11:53:18,013 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:18,014 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, 1, 1, 1] [2018-03-23 11:53:18,014 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:18,014 INFO L82 PathProgramCache]: Analyzing trace with hash 80098363, now seen corresponding path program 1 times [2018-03-23 11:53:18,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:18,014 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:18,015 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:18,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:18,015 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:18,028 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:18,171 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:18,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:18,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-03-23 11:53:18,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-23 11:53:18,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-23 11:53:18,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:53:18,172 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 8 states. [2018-03-23 11:53:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:18,318 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-03-23 11:53:18,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-23 11:53:18,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-03-23 11:53:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:18,320 INFO L225 Difference]: With dead ends: 210 [2018-03-23 11:53:18,321 INFO L226 Difference]: Without dead ends: 124 [2018-03-23 11:53:18,321 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-03-23 11:53:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-03-23 11:53:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117. [2018-03-23 11:53:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-03-23 11:53:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-03-23 11:53:18,338 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 29 [2018-03-23 11:53:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:18,338 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-03-23 11:53:18,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-23 11:53:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-03-23 11:53:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-03-23 11:53:18,340 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:18,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:18,340 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:18,340 INFO L82 PathProgramCache]: Analyzing trace with hash -666706721, now seen corresponding path program 1 times [2018-03-23 11:53:18,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:18,341 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:18,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:18,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:18,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:18,357 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:18,398 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:18,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:18,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 11:53:18,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:53:18,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:53:18,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:53:18,400 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 5 states. [2018-03-23 11:53:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:18,449 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-03-23 11:53:18,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 11:53:18,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-03-23 11:53:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:18,451 INFO L225 Difference]: With dead ends: 204 [2018-03-23 11:53:18,452 INFO L226 Difference]: Without dead ends: 124 [2018-03-23 11:53:18,452 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-23 11:53:18,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-03-23 11:53:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-03-23 11:53:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-03-23 11:53:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-03-23 11:53:18,463 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 41 [2018-03-23 11:53:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:18,464 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-03-23 11:53:18,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:53:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-03-23 11:53:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-03-23 11:53:18,465 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:18,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:18,465 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:18,465 INFO L82 PathProgramCache]: Analyzing trace with hash -699612892, now seen corresponding path program 1 times [2018-03-23 11:53:18,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:18,465 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:18,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:18,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:18,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:18,484 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:18,629 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:18,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:18,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-03-23 11:53:18,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:53:18,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:53:18,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:53:18,631 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 5 states. [2018-03-23 11:53:18,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:18,764 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-03-23 11:53:18,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:53:18,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-03-23 11:53:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:18,765 INFO L225 Difference]: With dead ends: 120 [2018-03-23 11:53:18,765 INFO L226 Difference]: Without dead ends: 118 [2018-03-23 11:53:18,766 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-23 11:53:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-03-23 11:53:18,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-03-23 11:53:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-03-23 11:53:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2018-03-23 11:53:18,777 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 41 [2018-03-23 11:53:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:18,778 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2018-03-23 11:53:18,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:53:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2018-03-23 11:53:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-03-23 11:53:18,779 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:18,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:18,780 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:18,780 INFO L82 PathProgramCache]: Analyzing trace with hash -699612891, now seen corresponding path program 1 times [2018-03-23 11:53:18,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:18,780 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:18,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:18,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:18,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:18,797 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:18,954 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:18,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:18,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-03-23 11:53:18,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-23 11:53:18,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-23 11:53:18,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:53:18,956 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 8 states. [2018-03-23 11:53:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:19,270 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-03-23 11:53:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-23 11:53:19,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-03-23 11:53:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:19,272 INFO L225 Difference]: With dead ends: 139 [2018-03-23 11:53:19,272 INFO L226 Difference]: Without dead ends: 137 [2018-03-23 11:53:19,273 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-03-23 11:53:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-03-23 11:53:19,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2018-03-23 11:53:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-03-23 11:53:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2018-03-23 11:53:19,285 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 41 [2018-03-23 11:53:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:19,286 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2018-03-23 11:53:19,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-23 11:53:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2018-03-23 11:53:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-03-23 11:53:19,288 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:19,288 INFO L353 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:19,288 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:19,288 INFO L82 PathProgramCache]: Analyzing trace with hash 521847270, now seen corresponding path program 1 times [2018-03-23 11:53:19,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:19,289 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:19,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:19,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:19,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:19,313 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:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:19,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:19,591 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:19,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:19,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:19,701 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:19,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:19,710 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:19,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:19,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:19,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-23 11:53:19,753 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-03-23 11:53:19,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:53:19,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:19,780 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 8 treesize of output 7 [2018-03-23 11:53:19,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:19,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:19,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:53:19,869 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= (store |c_old(#length)| v_prenex_1 (* 4 v_prenex_2)) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_1)))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-03-23 11:53:19,900 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:19,901 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:19,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:53:19,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:19,916 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 14 treesize of output 17 [2018-03-23 11:53:19,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:19,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:19,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-03-23 11:53:20,101 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:20,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:53:20,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-03-23 11:53:20,134 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:20,135 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:20,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:53:20,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:20,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-03-23 11:53:20,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:38, output treesize:52 [2018-03-23 11:53:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-03-23 11:53:20,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:20,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-03-23 11:53:20,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-03-23 11:53:20,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-03-23 11:53:20,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=400, Unknown=2, NotChecked=82, Total=552 [2018-03-23 11:53:20,267 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 24 states. [2018-03-23 11:53:22,132 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))))) is different from true [2018-03-23 11:53:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:23,422 INFO L93 Difference]: Finished difference Result 283 states and 310 transitions. [2018-03-23 11:53:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-03-23 11:53:23,422 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-03-23 11:53:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:23,424 INFO L225 Difference]: With dead ends: 283 [2018-03-23 11:53:23,424 INFO L226 Difference]: Without dead ends: 280 [2018-03-23 11:53:23,425 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=356, Invalid=2000, Unknown=8, NotChecked=288, Total=2652 [2018-03-23 11:53:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-03-23 11:53:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 200. [2018-03-23 11:53:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-03-23 11:53:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2018-03-23 11:53:23,448 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 57 [2018-03-23 11:53:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:23,448 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2018-03-23 11:53:23,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-03-23 11:53:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2018-03-23 11:53:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-03-23 11:53:23,449 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:23,450 INFO L353 BasicCegarLoop]: trace histogram [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, 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:23,450 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1227537339, now seen corresponding path program 1 times [2018-03-23 11:53:23,450 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:23,450 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:23,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:23,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:23,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:23,465 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:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:23,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:23,522 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:23,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:23,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:23,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:23,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-03-23 11:53:23,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-23 11:53:23,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-23 11:53:23,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-03-23 11:53:23,590 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand 7 states. [2018-03-23 11:53:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:23,744 INFO L93 Difference]: Finished difference Result 230 states and 257 transitions. [2018-03-23 11:53:23,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:53:23,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-03-23 11:53:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:23,749 INFO L225 Difference]: With dead ends: 230 [2018-03-23 11:53:23,749 INFO L226 Difference]: Without dead ends: 218 [2018-03-23 11:53:23,750 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:53:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-03-23 11:53:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2018-03-23 11:53:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-03-23 11:53:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 229 transitions. [2018-03-23 11:53:23,767 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 229 transitions. Word has length 57 [2018-03-23 11:53:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:23,767 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 229 transitions. [2018-03-23 11:53:23,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-23 11:53:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 229 transitions. [2018-03-23 11:53:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-03-23 11:53:23,768 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:23,769 INFO L353 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:23,769 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1002603826, now seen corresponding path program 1 times [2018-03-23 11:53:23,769 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:23,769 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:23,770 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:23,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:23,770 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:23,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:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-03-23 11:53:23,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:23,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 11:53:23,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 11:53:23,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 11:53:23,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:53:23,816 INFO L87 Difference]: Start difference. First operand 206 states and 229 transitions. Second operand 3 states. [2018-03-23 11:53:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:23,871 INFO L93 Difference]: Finished difference Result 206 states and 229 transitions. [2018-03-23 11:53:23,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 11:53:23,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-03-23 11:53:23,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:23,873 INFO L225 Difference]: With dead ends: 206 [2018-03-23 11:53:23,873 INFO L226 Difference]: Without dead ends: 205 [2018-03-23 11:53:23,874 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:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-03-23 11:53:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-03-23 11:53:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-03-23 11:53:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 227 transitions. [2018-03-23 11:53:23,891 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 227 transitions. Word has length 58 [2018-03-23 11:53:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:23,891 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 227 transitions. [2018-03-23 11:53:23,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 11:53:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 227 transitions. [2018-03-23 11:53:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-03-23 11:53:23,893 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:23,893 INFO L353 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:23,893 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:23,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1002603825, now seen corresponding path program 1 times [2018-03-23 11:53:23,893 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:23,893 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:23,894 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:23,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:23,894 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:23,912 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:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 11:53:24,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:24,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-03-23 11:53:24,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-23 11:53:24,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-23 11:53:24,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-03-23 11:53:24,173 INFO L87 Difference]: Start difference. First operand 205 states and 227 transitions. Second operand 10 states. [2018-03-23 11:53:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:24,343 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2018-03-23 11:53:24,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-23 11:53:24,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-03-23 11:53:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:24,345 INFO L225 Difference]: With dead ends: 205 [2018-03-23 11:53:24,345 INFO L226 Difference]: Without dead ends: 204 [2018-03-23 11:53:24,346 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-03-23 11:53:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-03-23 11:53:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-03-23 11:53:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-03-23 11:53:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2018-03-23 11:53:24,365 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 58 [2018-03-23 11:53:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:24,366 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2018-03-23 11:53:24,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-23 11:53:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2018-03-23 11:53:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-03-23 11:53:24,367 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:24,367 INFO L353 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:24,367 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash -445614296, now seen corresponding path program 1 times [2018-03-23 11:53:24,368 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:24,368 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:24,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:24,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:24,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:24,383 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:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:24,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:24,480 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:24,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:24,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:24,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:53:24,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2018-03-23 11:53:24,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-23 11:53:24,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-23 11:53:24,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-03-23 11:53:24,656 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand 11 states. [2018-03-23 11:53:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:24,819 INFO L93 Difference]: Finished difference Result 351 states and 389 transitions. [2018-03-23 11:53:24,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-23 11:53:24,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-03-23 11:53:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:24,823 INFO L225 Difference]: With dead ends: 351 [2018-03-23 11:53:24,823 INFO L226 Difference]: Without dead ends: 194 [2018-03-23 11:53:24,824 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-03-23 11:53:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-03-23 11:53:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 183. [2018-03-23 11:53:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-03-23 11:53:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2018-03-23 11:53:24,836 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 65 [2018-03-23 11:53:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:24,836 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2018-03-23 11:53:24,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-23 11:53:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2018-03-23 11:53:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-03-23 11:53:24,837 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:24,837 INFO L353 BasicCegarLoop]: trace histogram [3, 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, 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:24,837 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:24,837 INFO L82 PathProgramCache]: Analyzing trace with hash 165743771, now seen corresponding path program 1 times [2018-03-23 11:53:24,837 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:24,837 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:24,838 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:24,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:24,839 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:24,851 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:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:24,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:24,982 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:24,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:25,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:25,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:25,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-03-23 11:53:25,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-23 11:53:25,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-23 11:53:25,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-03-23 11:53:25,180 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand 15 states. [2018-03-23 11:53:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:25,469 INFO L93 Difference]: Finished difference Result 314 states and 337 transitions. [2018-03-23 11:53:25,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-23 11:53:25,470 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-03-23 11:53:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:25,471 INFO L225 Difference]: With dead ends: 314 [2018-03-23 11:53:25,471 INFO L226 Difference]: Without dead ends: 188 [2018-03-23 11:53:25,472 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-03-23 11:53:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-03-23 11:53:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2018-03-23 11:53:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-03-23 11:53:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-03-23 11:53:25,482 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 65 [2018-03-23 11:53:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:25,482 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-03-23 11:53:25,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-23 11:53:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-03-23 11:53:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-03-23 11:53:25,483 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:25,483 INFO L353 BasicCegarLoop]: trace histogram [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, 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:25,483 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1185889501, now seen corresponding path program 1 times [2018-03-23 11:53:25,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:25,484 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:25,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:25,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:25,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:25,503 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:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-03-23 11:53:25,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:25,645 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:25,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:25,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-03-23 11:53:25,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:25,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 18 [2018-03-23 11:53:25,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-23 11:53:25,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-23 11:53:25,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-03-23 11:53:25,836 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 19 states. [2018-03-23 11:53:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:26,750 INFO L93 Difference]: Finished difference Result 250 states and 267 transitions. [2018-03-23 11:53:26,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-03-23 11:53:26,750 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-03-23 11:53:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:26,753 INFO L225 Difference]: With dead ends: 250 [2018-03-23 11:53:26,753 INFO L226 Difference]: Without dead ends: 249 [2018-03-23 11:53:26,753 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-03-23 11:53:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-03-23 11:53:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 184. [2018-03-23 11:53:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-03-23 11:53:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2018-03-23 11:53:26,767 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 73 [2018-03-23 11:53:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:26,768 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2018-03-23 11:53:26,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-23 11:53:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2018-03-23 11:53:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-03-23 11:53:26,768 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:26,768 INFO L353 BasicCegarLoop]: trace histogram [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, 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:26,769 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1185889500, now seen corresponding path program 1 times [2018-03-23 11:53:26,769 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:26,769 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:26,770 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:26,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:26,770 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:26,779 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:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-03-23 11:53:26,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:26,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-03-23 11:53:26,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:53:26,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:53:26,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:53:26,842 INFO L87 Difference]: Start difference. First operand 184 states and 196 transitions. Second operand 5 states. [2018-03-23 11:53:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:27,022 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2018-03-23 11:53:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 11:53:27,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-03-23 11:53:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:27,023 INFO L225 Difference]: With dead ends: 184 [2018-03-23 11:53:27,023 INFO L226 Difference]: Without dead ends: 183 [2018-03-23 11:53:27,024 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-23 11:53:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-03-23 11:53:27,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-03-23 11:53:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-03-23 11:53:27,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 192 transitions. [2018-03-23 11:53:27,038 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 192 transitions. Word has length 73 [2018-03-23 11:53:27,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:27,038 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 192 transitions. [2018-03-23 11:53:27,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:53:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 192 transitions. [2018-03-23 11:53:27,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-03-23 11:53:27,038 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:27,039 INFO L353 BasicCegarLoop]: trace histogram [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, 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:27,039 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:27,039 INFO L82 PathProgramCache]: Analyzing trace with hash -910864110, now seen corresponding path program 1 times [2018-03-23 11:53:27,039 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:27,039 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:27,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:27,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:27,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:27,051 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:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-03-23 11:53:27,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:27,350 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:27,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:27,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-23 11:53:27,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:27,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2018-03-23 11:53:27,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-23 11:53:27,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-23 11:53:27,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-03-23 11:53:27,566 INFO L87 Difference]: Start difference. First operand 183 states and 192 transitions. Second operand 18 states. [2018-03-23 11:53:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:28,349 INFO L93 Difference]: Finished difference Result 346 states and 368 transitions. [2018-03-23 11:53:28,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-03-23 11:53:28,349 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2018-03-23 11:53:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:28,351 INFO L225 Difference]: With dead ends: 346 [2018-03-23 11:53:28,351 INFO L226 Difference]: Without dead ends: 241 [2018-03-23 11:53:28,351 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2018-03-23 11:53:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-03-23 11:53:28,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 212. [2018-03-23 11:53:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-03-23 11:53:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 223 transitions. [2018-03-23 11:53:28,365 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 223 transitions. Word has length 81 [2018-03-23 11:53:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:28,365 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 223 transitions. [2018-03-23 11:53:28,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-23 11:53:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 223 transitions. [2018-03-23 11:53:28,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-03-23 11:53:28,366 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:28,366 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:28,366 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:28,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1982601529, now seen corresponding path program 1 times [2018-03-23 11:53:28,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:28,366 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:28,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:28,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:28,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:28,378 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:28,575 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 17 DAG size of output 14 [2018-03-23 11:53:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-03-23 11:53:28,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:28,780 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:28,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:28,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-03-23 11:53:29,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:53:29,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 16 [2018-03-23 11:53:29,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-03-23 11:53:29,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-03-23 11:53:29,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-03-23 11:53:29,070 INFO L87 Difference]: Start difference. First operand 212 states and 223 transitions. Second operand 16 states. [2018-03-23 11:53:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:29,356 INFO L93 Difference]: Finished difference Result 342 states and 360 transitions. [2018-03-23 11:53:29,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-03-23 11:53:29,357 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 85 [2018-03-23 11:53:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:29,357 INFO L225 Difference]: With dead ends: 342 [2018-03-23 11:53:29,358 INFO L226 Difference]: Without dead ends: 205 [2018-03-23 11:53:29,358 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-03-23 11:53:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-03-23 11:53:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2018-03-23 11:53:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-03-23 11:53:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 207 transitions. [2018-03-23 11:53:29,373 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 207 transitions. Word has length 85 [2018-03-23 11:53:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:29,373 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 207 transitions. [2018-03-23 11:53:29,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-03-23 11:53:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 207 transitions. [2018-03-23 11:53:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-03-23 11:53:29,374 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:29,374 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:29,374 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:29,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1400008503, now seen corresponding path program 1 times [2018-03-23 11:53:29,374 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:29,375 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:29,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:29,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:29,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:29,390 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:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-03-23 11:53:30,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:30,015 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:30,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:30,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:30,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:53:30,115 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 8 treesize of output 7 [2018-03-23 11:53:30,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:30,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:30,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:30,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-03-23 11:53:30,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2018-03-23 11:53:30,256 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 17 treesize of output 16 [2018-03-23 11:53:30,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:30,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:30,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:30,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:11 [2018-03-23 11:53:30,387 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0 (select (select |c_old(#memory_int)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|)))) (= (select (select |c_#memory_int| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~ret4|))) is different from true [2018-03-23 11:53:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-03-23 11:53:30,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:30,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 37 [2018-03-23 11:53:30,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-03-23 11:53:30,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-03-23 11:53:30,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1130, Unknown=17, NotChecked=68, Total=1332 [2018-03-23 11:53:30,511 INFO L87 Difference]: Start difference. First operand 199 states and 207 transitions. Second operand 37 states. [2018-03-23 11:53:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:32,444 INFO L93 Difference]: Finished difference Result 358 states and 379 transitions. [2018-03-23 11:53:32,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-03-23 11:53:32,444 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 93 [2018-03-23 11:53:32,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:32,446 INFO L225 Difference]: With dead ends: 358 [2018-03-23 11:53:32,446 INFO L226 Difference]: Without dead ends: 248 [2018-03-23 11:53:32,448 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=482, Invalid=4162, Unknown=52, NotChecked=134, Total=4830 [2018-03-23 11:53:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-03-23 11:53:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 204. [2018-03-23 11:53:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-03-23 11:53:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 212 transitions. [2018-03-23 11:53:32,472 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 212 transitions. Word has length 93 [2018-03-23 11:53:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:32,472 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 212 transitions. [2018-03-23 11:53:32,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-03-23 11:53:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 212 transitions. [2018-03-23 11:53:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-03-23 11:53:32,473 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:32,474 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2018-03-23 11:53:32,474 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:32,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1499412931, now seen corresponding path program 1 times [2018-03-23 11:53:32,474 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:32,474 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:32,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:32,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:32,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:32,494 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:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-03-23 11:53:32,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:32,719 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:32,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:32,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:32,872 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:32,873 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 19 treesize of output 22 [2018-03-23 11:53:32,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:32,883 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:32,884 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:32,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:53:32,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:32,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:32,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:28 [2018-03-23 11:53:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-03-23 11:53:32,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:32,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-03-23 11:53:32,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-23 11:53:32,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-23 11:53:32,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-03-23 11:53:32,988 INFO L87 Difference]: Start difference. First operand 204 states and 212 transitions. Second operand 21 states. [2018-03-23 11:53:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:33,405 INFO L93 Difference]: Finished difference Result 205 states and 212 transitions. [2018-03-23 11:53:33,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-03-23 11:53:33,406 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2018-03-23 11:53:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:33,407 INFO L225 Difference]: With dead ends: 205 [2018-03-23 11:53:33,407 INFO L226 Difference]: Without dead ends: 202 [2018-03-23 11:53:33,408 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2018-03-23 11:53:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-03-23 11:53:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2018-03-23 11:53:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-03-23 11:53:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 197 transitions. [2018-03-23 11:53:33,430 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 197 transitions. Word has length 109 [2018-03-23 11:53:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:33,431 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 197 transitions. [2018-03-23 11:53:33,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-23 11:53:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 197 transitions. [2018-03-23 11:53:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-03-23 11:53:33,432 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:33,432 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:33,432 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash -793722862, now seen corresponding path program 1 times [2018-03-23 11:53:33,432 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:33,432 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:33,433 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:33,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:33,433 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:33,447 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:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-03-23 11:53:33,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:33,505 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:33,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:33,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-03-23 11:53:33,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:33,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-03-23 11:53:33,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 11:53:33,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 11:53:33,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:53:33,630 INFO L87 Difference]: Start difference. First operand 192 states and 197 transitions. Second operand 9 states. [2018-03-23 11:53:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:33,693 INFO L93 Difference]: Finished difference Result 217 states and 224 transitions. [2018-03-23 11:53:33,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 11:53:33,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2018-03-23 11:53:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:33,694 INFO L225 Difference]: With dead ends: 217 [2018-03-23 11:53:33,695 INFO L226 Difference]: Without dead ends: 205 [2018-03-23 11:53:33,695 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-03-23 11:53:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-03-23 11:53:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 198. [2018-03-23 11:53:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-03-23 11:53:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 203 transitions. [2018-03-23 11:53:33,710 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 203 transitions. Word has length 109 [2018-03-23 11:53:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:33,710 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 203 transitions. [2018-03-23 11:53:33,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 11:53:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 203 transitions. [2018-03-23 11:53:33,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-03-23 11:53:33,711 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:33,711 INFO L353 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-03-23 11:53:33,711 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:33,711 INFO L82 PathProgramCache]: Analyzing trace with hash 543476210, now seen corresponding path program 2 times [2018-03-23 11:53:33,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:33,711 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:33,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:33,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:33,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:33,731 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:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-03-23 11:53:34,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:34,011 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:34,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:34,048 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:34,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:34,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:34,182 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:34,183 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:34,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:53:34,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:34,192 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 19 treesize of output 22 [2018-03-23 11:53:34,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:34,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:34,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:30 [2018-03-23 11:53:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 43 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-03-23 11:53:34,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:34,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-03-23 11:53:34,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-03-23 11:53:34,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-03-23 11:53:34,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-03-23 11:53:34,404 INFO L87 Difference]: Start difference. First operand 198 states and 203 transitions. Second operand 26 states. [2018-03-23 11:53:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:36,666 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2018-03-23 11:53:36,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-03-23 11:53:36,667 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-03-23 11:53:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:36,668 INFO L225 Difference]: With dead ends: 249 [2018-03-23 11:53:36,668 INFO L226 Difference]: Without dead ends: 248 [2018-03-23 11:53:36,669 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=591, Invalid=3441, Unknown=0, NotChecked=0, Total=4032 [2018-03-23 11:53:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-03-23 11:53:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 197. [2018-03-23 11:53:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-03-23 11:53:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 202 transitions. [2018-03-23 11:53:36,685 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 202 transitions. Word has length 117 [2018-03-23 11:53:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:36,685 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 202 transitions. [2018-03-23 11:53:36,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-03-23 11:53:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 202 transitions. [2018-03-23 11:53:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-03-23 11:53:36,686 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:36,686 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-03-23 11:53:36,686 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:36,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1045760738, now seen corresponding path program 2 times [2018-03-23 11:53:36,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:36,686 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:36,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:36,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:36,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:36,708 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:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 77 proven. 14 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-03-23 11:53:36,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:36,996 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:37,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:37,042 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:37,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:37,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 79 proven. 24 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-03-23 11:53:37,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:37,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 33 [2018-03-23 11:53:37,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-03-23 11:53:37,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-03-23 11:53:37,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2018-03-23 11:53:37,870 INFO L87 Difference]: Start difference. First operand 197 states and 202 transitions. Second operand 34 states. [2018-03-23 11:53:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:39,570 INFO L93 Difference]: Finished difference Result 305 states and 317 transitions. [2018-03-23 11:53:39,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-03-23 11:53:39,572 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 141 [2018-03-23 11:53:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:39,573 INFO L225 Difference]: With dead ends: 305 [2018-03-23 11:53:39,573 INFO L226 Difference]: Without dead ends: 304 [2018-03-23 11:53:39,575 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=529, Invalid=4873, Unknown=0, NotChecked=0, Total=5402 [2018-03-23 11:53:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-03-23 11:53:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 280. [2018-03-23 11:53:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-03-23 11:53:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 290 transitions. [2018-03-23 11:53:39,599 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 290 transitions. Word has length 141 [2018-03-23 11:53:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:39,599 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 290 transitions. [2018-03-23 11:53:39,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-03-23 11:53:39,599 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 290 transitions. [2018-03-23 11:53:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-03-23 11:53:39,600 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:39,600 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-03-23 11:53:39,600 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:39,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1565479950, now seen corresponding path program 2 times [2018-03-23 11:53:39,600 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:39,600 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:39,601 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:39,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:39,601 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:39,616 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:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 72 proven. 13 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-03-23 11:53:39,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:39,779 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:39,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:39,818 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:39,818 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:39,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-03-23 11:53:39,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:39,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 19 [2018-03-23 11:53:39,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-23 11:53:39,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-23 11:53:39,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-03-23 11:53:39,910 INFO L87 Difference]: Start difference. First operand 280 states and 290 transitions. Second operand 19 states. [2018-03-23 11:53:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:40,272 INFO L93 Difference]: Finished difference Result 467 states and 488 transitions. [2018-03-23 11:53:40,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-03-23 11:53:40,272 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 145 [2018-03-23 11:53:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:40,274 INFO L225 Difference]: With dead ends: 467 [2018-03-23 11:53:40,274 INFO L226 Difference]: Without dead ends: 269 [2018-03-23 11:53:40,275 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2018-03-23 11:53:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-03-23 11:53:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 250. [2018-03-23 11:53:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-03-23 11:53:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 257 transitions. [2018-03-23 11:53:40,307 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 257 transitions. Word has length 145 [2018-03-23 11:53:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:40,307 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 257 transitions. [2018-03-23 11:53:40,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-23 11:53:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 257 transitions. [2018-03-23 11:53:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-03-23 11:53:40,308 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:40,309 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-03-23 11:53:40,309 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1506247432, now seen corresponding path program 3 times [2018-03-23 11:53:40,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:40,309 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:40,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:40,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:40,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:40,336 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:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 10 proven. 78 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-03-23 11:53:40,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:40,995 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:41,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 11:53:41,042 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-03-23 11:53:41,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:41,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:41,050 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:41,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:41,054 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:41,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:41,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:41,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-23 11:53:41,079 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-03-23 11:53:41,083 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 8 treesize of output 7 [2018-03-23 11:53:41,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:41,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:53:41,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:41,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:41,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:53:41,113 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (and (= (store |c_old(#length)| v_prenex_6 (* 4 v_prenex_7)) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_6))))) is different from true [2018-03-23 11:53:41,129 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:41,137 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 14 treesize of output 17 [2018-03-23 11:53:41,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:41,149 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:41,150 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:41,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:53:41,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:41,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:41,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-03-23 11:53:41,212 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-03-23 11:53:41,228 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 8 treesize of output 7 [2018-03-23 11:53:41,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:41,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:41,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-03-23 11:53:41,267 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_9 Int)) (= (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_9)) |c_#length|)) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (v_prenex_8 Int)) (= (select |c_#length| v_prenex_8) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-03-23 11:53:41,273 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:41,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:41,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:41,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-03-23 11:53:41,281 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (v_prenex_9 Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_9)) |c_#length|))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (v_prenex_8 Int)) (= (select |c_#length| v_prenex_8) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-03-23 11:53:41,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:53:41,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-03-23 11:53:41,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2018-03-23 11:53:41,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:106 [2018-03-23 11:53:41,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:53:41,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:41,599 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 8 treesize of output 7 [2018-03-23 11:53:41,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:41,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:41,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:53:42,052 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_21 Int) (v_prenex_20 Int)) (and (= (store |c_old(#length)| v_prenex_20 (* 4 v_prenex_21)) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_20)))) (exists ((v_prenex_19 Int)) (and (<= v_prenex_19 1) (< v_prenex_19 |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (<= |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| (+ v_prenex_19 1)) (<= 0 (* 4 v_prenex_19))))) is different from true [2018-03-23 11:53:42,102 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:42,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:53:42,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-03-23 11:53:42,137 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:42,138 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:42,139 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:42,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-03-23 11:53:42,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:42,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-03-23 11:53:42,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:49, output treesize:64 [2018-03-23 11:53:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 61 proven. 23 refuted. 0 times theorem prover too weak. 33 trivial. 59 not checked. [2018-03-23 11:53:42,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:42,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28] total 46 [2018-03-23 11:53:42,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-03-23 11:53:42,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-03-23 11:53:42,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1483, Unknown=6, NotChecked=498, Total=2162 [2018-03-23 11:53:42,329 INFO L87 Difference]: Start difference. First operand 250 states and 257 transitions. Second operand 47 states. [2018-03-23 11:53:46,606 WARN L151 SmtUtils]: Spent 706ms on a formula simplification. DAG size of input: 54 DAG size of output 41 [2018-03-23 11:53:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:46,866 INFO L93 Difference]: Finished difference Result 373 states and 400 transitions. [2018-03-23 11:53:46,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-03-23 11:53:46,866 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 161 [2018-03-23 11:53:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:46,868 INFO L225 Difference]: With dead ends: 373 [2018-03-23 11:53:46,868 INFO L226 Difference]: Without dead ends: 372 [2018-03-23 11:53:46,871 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 139 SyntacticMatches, 8 SemanticMatches, 95 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2761 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=855, Invalid=7352, Unknown=7, NotChecked=1098, Total=9312 [2018-03-23 11:53:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-03-23 11:53:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 306. [2018-03-23 11:53:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-03-23 11:53:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 322 transitions. [2018-03-23 11:53:46,900 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 322 transitions. Word has length 161 [2018-03-23 11:53:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:46,900 INFO L459 AbstractCegarLoop]: Abstraction has 306 states and 322 transitions. [2018-03-23 11:53:46,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-03-23 11:53:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 322 transitions. [2018-03-23 11:53:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-03-23 11:53:46,901 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:46,902 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-03-23 11:53:46,902 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:46,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1950511502, now seen corresponding path program 1 times [2018-03-23 11:53:46,902 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:46,902 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:46,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:46,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:46,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:46,925 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,061 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-03-23 11:53:47,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:47,062 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:47,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:47,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-03-23 11:53:47,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:47,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-03-23 11:53:47,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-23 11:53:47,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-23 11:53:47,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-03-23 11:53:47,187 INFO L87 Difference]: Start difference. First operand 306 states and 322 transitions. Second operand 11 states. [2018-03-23 11:53:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:47,282 INFO L93 Difference]: Finished difference Result 347 states and 372 transitions. [2018-03-23 11:53:47,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-03-23 11:53:47,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 177 [2018-03-23 11:53:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:47,283 INFO L225 Difference]: With dead ends: 347 [2018-03-23 11:53:47,284 INFO L226 Difference]: Without dead ends: 335 [2018-03-23 11:53:47,284 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-03-23 11:53:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-03-23 11:53:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 320. [2018-03-23 11:53:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-03-23 11:53:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 336 transitions. [2018-03-23 11:53:47,311 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 336 transitions. Word has length 177 [2018-03-23 11:53:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:47,312 INFO L459 AbstractCegarLoop]: Abstraction has 320 states and 336 transitions. [2018-03-23 11:53:47,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-23 11:53:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 336 transitions. [2018-03-23 11:53:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-03-23 11:53:47,313 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:47,313 INFO L353 BasicCegarLoop]: trace histogram [9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:47,313 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:47,313 INFO L82 PathProgramCache]: Analyzing trace with hash -927285809, now seen corresponding path program 1 times [2018-03-23 11:53:47,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:47,314 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:47,314 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:47,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:47,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:47,342 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,621 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 170 proven. 21 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-03-23 11:53:47,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:47,621 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:47,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:47,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 219 proven. 12 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-03-23 11:53:47,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:47,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-03-23 11:53:47,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-03-23 11:53:47,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-03-23 11:53:47,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-03-23 11:53:47,904 INFO L87 Difference]: Start difference. First operand 320 states and 336 transitions. Second operand 29 states. [2018-03-23 11:53:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:48,944 INFO L93 Difference]: Finished difference Result 548 states and 587 transitions. [2018-03-23 11:53:48,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-03-23 11:53:48,944 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 217 [2018-03-23 11:53:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:48,946 INFO L225 Difference]: With dead ends: 548 [2018-03-23 11:53:48,946 INFO L226 Difference]: Without dead ends: 385 [2018-03-23 11:53:48,947 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=363, Invalid=3059, Unknown=0, NotChecked=0, Total=3422 [2018-03-23 11:53:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-03-23 11:53:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 363. [2018-03-23 11:53:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-03-23 11:53:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 380 transitions. [2018-03-23 11:53:48,988 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 380 transitions. Word has length 217 [2018-03-23 11:53:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:48,989 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 380 transitions. [2018-03-23 11:53:48,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-03-23 11:53:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 380 transitions. [2018-03-23 11:53:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-03-23 11:53:48,991 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:48,992 INFO L353 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:48,992 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1779362948, now seen corresponding path program 2 times [2018-03-23 11:53:48,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:48,992 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:48,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:48,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:48,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:49,022 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,604 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 230 proven. 33 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-03-23 11:53:49,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:49,605 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:49,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:49,692 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:49,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:49,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 241 proven. 52 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-03-23 11:53:50,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:50,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 43 [2018-03-23 11:53:50,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-03-23 11:53:50,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-03-23 11:53:50,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2018-03-23 11:53:50,486 INFO L87 Difference]: Start difference. First operand 363 states and 380 transitions. Second operand 44 states. [2018-03-23 11:53:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:53,387 INFO L93 Difference]: Finished difference Result 492 states and 520 transitions. [2018-03-23 11:53:53,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-03-23 11:53:53,387 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 225 [2018-03-23 11:53:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:53,389 INFO L225 Difference]: With dead ends: 492 [2018-03-23 11:53:53,389 INFO L226 Difference]: Without dead ends: 491 [2018-03-23 11:53:53,392 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3500 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1074, Invalid=11358, Unknown=0, NotChecked=0, Total=12432 [2018-03-23 11:53:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-03-23 11:53:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 462. [2018-03-23 11:53:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-03-23 11:53:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 487 transitions. [2018-03-23 11:53:53,431 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 487 transitions. Word has length 225 [2018-03-23 11:53:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:53,431 INFO L459 AbstractCegarLoop]: Abstraction has 462 states and 487 transitions. [2018-03-23 11:53:53,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-03-23 11:53:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 487 transitions. [2018-03-23 11:53:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-03-23 11:53:53,434 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:53,434 INFO L353 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:53,434 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:53,434 INFO L82 PathProgramCache]: Analyzing trace with hash 31434131, now seen corresponding path program 4 times [2018-03-23 11:53:53,434 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:53,434 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:53,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:53,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:53,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:53,456 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,783 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 264 proven. 39 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-03-23 11:53:53,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:53,783 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:53,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-03-23 11:53:53,862 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-03-23 11:53:53,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:53,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 33 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-03-23 11:53:54,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:54,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-03-23 11:53:54,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-03-23 11:53:54,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-03-23 11:53:54,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-03-23 11:53:54,150 INFO L87 Difference]: Start difference. First operand 462 states and 487 transitions. Second operand 27 states. [2018-03-23 11:53:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:54,912 INFO L93 Difference]: Finished difference Result 704 states and 746 transitions. [2018-03-23 11:53:54,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-03-23 11:53:54,913 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 253 [2018-03-23 11:53:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:54,915 INFO L225 Difference]: With dead ends: 704 [2018-03-23 11:53:54,916 INFO L226 Difference]: Without dead ends: 376 [2018-03-23 11:53:54,917 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=1914, Unknown=0, NotChecked=0, Total=2162 [2018-03-23 11:53:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-03-23 11:53:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 354. [2018-03-23 11:53:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-03-23 11:53:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 362 transitions. [2018-03-23 11:53:54,969 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 362 transitions. Word has length 253 [2018-03-23 11:53:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:54,970 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 362 transitions. [2018-03-23 11:53:54,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-03-23 11:53:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 362 transitions. [2018-03-23 11:53:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-03-23 11:53:54,971 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:54,972 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:54,972 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:54,972 INFO L82 PathProgramCache]: Analyzing trace with hash -655571618, now seen corresponding path program 5 times [2018-03-23 11:53:54,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:54,972 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:54,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:54,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:54,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:55,010 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,889 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 105 proven. 158 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-03-23 11:53:55,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:55,890 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:55,897 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-03-23 11:53:55,997 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-03-23 11:53:55,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:56,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:56,008 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:56,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:56,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:56,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:53:56,077 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-03-23 11:53:56,082 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 8 treesize of output 7 [2018-03-23 11:53:56,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:56,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:56,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-03-23 11:53:56,134 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_24 Int)) (= |c_#length| (store |c_old(#length)| |c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_24)))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_7| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_7|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-03-23 11:53:56,141 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:56,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:56,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:56,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-03-23 11:53:56,153 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_24 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= (select |c_#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) 0) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_24))))) (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_7| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_7|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-03-23 11:53:56,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 17 [2018-03-23 11:53:56,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-03-23 11:53:56,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-03-23 11:53:56,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-03-23 11:53:56,381 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-03-23 11:53:56,393 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 8 treesize of output 7 [2018-03-23 11:53:56,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:56,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:53:56,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:56,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:56,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:53:56,448 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_7| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_7|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_28 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_28)) |c_#length|)))) is different from true [2018-03-23 11:53:56,463 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:56,464 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:56,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:53:56,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-03-23 11:53:56,501 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:56,503 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:56,503 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:56,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-03-23 11:53:56,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:56,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:53:56,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:56, output treesize:86 [2018-03-23 11:53:56,759 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 8 treesize of output 7 [2018-03-23 11:53:56,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:56,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:53:56,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:56,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:56,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:53:56,809 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_7| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_7|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_34 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_34)))))) is different from true [2018-03-23 11:53:56,820 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:56,820 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:56,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:53:56,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:56,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:53:56,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-23 11:53:56,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:53:56,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-03-23 11:53:57,075 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 8 treesize of output 7 [2018-03-23 11:53:57,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:57,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:53:57,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:57,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:57,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:53:57,125 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_7| Int)) (= (select |c_#length| |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_BEFORE_CALL_7|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_40 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 v_prenex_40)) |c_#length|)))) is different from true [2018-03-23 11:53:57,135 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:57,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:53:57,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-03-23 11:53:57,172 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:57,173 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:57,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:53:57,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:57,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:53:57,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-03-23 11:53:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 370 trivial. 100 not checked. [2018-03-23 11:53:57,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:57,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 52 [2018-03-23 11:53:57,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-03-23 11:53:57,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-03-23 11:53:57,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1821, Unknown=7, NotChecked=658, Total=2756 [2018-03-23 11:53:57,445 INFO L87 Difference]: Start difference. First operand 354 states and 362 transitions. Second operand 53 states. [2018-03-23 11:53:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:59,273 INFO L93 Difference]: Finished difference Result 377 states and 388 transitions. [2018-03-23 11:53:59,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-03-23 11:53:59,273 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 245 [2018-03-23 11:53:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:59,275 INFO L225 Difference]: With dead ends: 377 [2018-03-23 11:53:59,275 INFO L226 Difference]: Without dead ends: 376 [2018-03-23 11:53:59,275 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 223 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1985 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=599, Invalid=4243, Unknown=16, NotChecked=994, Total=5852 [2018-03-23 11:53:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-03-23 11:53:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 356. [2018-03-23 11:53:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-03-23 11:53:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 364 transitions. [2018-03-23 11:53:59,330 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 364 transitions. Word has length 245 [2018-03-23 11:53:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:59,331 INFO L459 AbstractCegarLoop]: Abstraction has 356 states and 364 transitions. [2018-03-23 11:53:59,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-03-23 11:53:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 364 transitions. [2018-03-23 11:53:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-03-23 11:53:59,333 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:59,333 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-03-23 11:53:59,333 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1458229772, now seen corresponding path program 2 times [2018-03-23 11:53:59,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:59,334 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:59,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:59,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:59,335 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:59,361 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:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2018-03-23 11:53:59,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:59,605 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:59,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:59,664 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:59,664 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:59,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2018-03-23 11:53:59,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:59,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-03-23 11:53:59,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-23 11:53:59,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-23 11:53:59,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-03-23 11:53:59,736 INFO L87 Difference]: Start difference. First operand 356 states and 364 transitions. Second operand 13 states. [2018-03-23 11:53:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:59,873 INFO L93 Difference]: Finished difference Result 381 states and 391 transitions. [2018-03-23 11:53:59,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-03-23 11:53:59,873 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 261 [2018-03-23 11:53:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:59,874 INFO L225 Difference]: With dead ends: 381 [2018-03-23 11:53:59,874 INFO L226 Difference]: Without dead ends: 369 [2018-03-23 11:53:59,875 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2018-03-23 11:53:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-03-23 11:53:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2018-03-23 11:53:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-03-23 11:53:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 370 transitions. [2018-03-23 11:53:59,908 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 370 transitions. Word has length 261 [2018-03-23 11:53:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:59,908 INFO L459 AbstractCegarLoop]: Abstraction has 362 states and 370 transitions. [2018-03-23 11:53:59,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-23 11:53:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 370 transitions. [2018-03-23 11:53:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-03-23 11:53:59,910 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:59,910 INFO L353 BasicCegarLoop]: trace histogram [14, 14, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:59,910 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:53:59,910 INFO L82 PathProgramCache]: Analyzing trace with hash -452674529, now seen corresponding path program 3 times [2018-03-23 11:53:59,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:59,910 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:59,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:59,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:59,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:59,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1041 backedges. 423 proven. 46 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2018-03-23 11:54:00,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:00,283 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:00,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 11:54:00,319 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-03-23 11:54:00,319 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:00,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1041 backedges. 292 proven. 3 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2018-03-23 11:54:00,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:00,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 30 [2018-03-23 11:54:00,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-03-23 11:54:00,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-03-23 11:54:00,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2018-03-23 11:54:00,767 INFO L87 Difference]: Start difference. First operand 362 states and 370 transitions. Second operand 30 states. [2018-03-23 11:54:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:02,707 INFO L93 Difference]: Finished difference Result 615 states and 638 transitions. [2018-03-23 11:54:02,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-03-23 11:54:02,707 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 317 [2018-03-23 11:54:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:02,710 INFO L225 Difference]: With dead ends: 615 [2018-03-23 11:54:02,710 INFO L226 Difference]: Without dead ends: 481 [2018-03-23 11:54:02,711 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=763, Invalid=5879, Unknown=0, NotChecked=0, Total=6642 [2018-03-23 11:54:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-03-23 11:54:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 446. [2018-03-23 11:54:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-03-23 11:54:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 456 transitions. [2018-03-23 11:54:02,774 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 456 transitions. Word has length 317 [2018-03-23 11:54:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:02,775 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 456 transitions. [2018-03-23 11:54:02,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-03-23 11:54:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 456 transitions. [2018-03-23 11:54:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-03-23 11:54:02,777 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:02,777 INFO L353 BasicCegarLoop]: trace histogram [14, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:02,778 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:54:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash -794775868, now seen corresponding path program 6 times [2018-03-23 11:54:02,778 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:02,778 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:02,779 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:02,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:02,779 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:02,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 487 proven. 57 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-03-23 11:54:03,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:03,350 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-03-23 11:54:03,474 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-03-23 11:54:03,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:03,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 302 proven. 30 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-03-23 11:54:03,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:03,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 31 [2018-03-23 11:54:03,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-23 11:54:03,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-23 11:54:03,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-03-23 11:54:03,704 INFO L87 Difference]: Start difference. First operand 446 states and 456 transitions. Second operand 31 states. [2018-03-23 11:54:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:04,393 INFO L93 Difference]: Finished difference Result 680 states and 701 transitions. [2018-03-23 11:54:04,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-03-23 11:54:04,393 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 329 [2018-03-23 11:54:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:04,396 INFO L225 Difference]: With dead ends: 680 [2018-03-23 11:54:04,396 INFO L226 Difference]: Without dead ends: 474 [2018-03-23 11:54:04,397 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=418, Invalid=3488, Unknown=0, NotChecked=0, Total=3906 [2018-03-23 11:54:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-03-23 11:54:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 419. [2018-03-23 11:54:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-03-23 11:54:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 428 transitions. [2018-03-23 11:54:04,440 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 428 transitions. Word has length 329 [2018-03-23 11:54:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:04,440 INFO L459 AbstractCegarLoop]: Abstraction has 419 states and 428 transitions. [2018-03-23 11:54:04,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-23 11:54:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 428 transitions. [2018-03-23 11:54:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-03-23 11:54:04,442 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:04,442 INFO L353 BasicCegarLoop]: trace histogram [15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:04,442 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:54:04,442 INFO L82 PathProgramCache]: Analyzing trace with hash 720415662, now seen corresponding path program 7 times [2018-03-23 11:54:04,442 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:04,443 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:04,443 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:04,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:04,443 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:04,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 237 proven. 354 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-03-23 11:54:05,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:05,815 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:05,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:05,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:05,906 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:54:05,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:05,923 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:54:05,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:05,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:05,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-23 11:54:05,980 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-03-23 11:54:05,984 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 8 treesize of output 7 [2018-03-23 11:54:05,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:05,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:05,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:05,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:05,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:54:06,018 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_49 Int) (v_prenex_48 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_48)) (= (store |c_old(#length)| v_prenex_48 (* 4 v_prenex_49)) |c_#length|)))) is different from true [2018-03-23 11:54:06,031 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,033 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 14 treesize of output 17 [2018-03-23 11:54:06,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,047 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,047 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:06,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:06,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:37, output treesize:30 [2018-03-23 11:54:06,215 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 8 treesize of output 7 [2018-03-23 11:54:06,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:06,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:06,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:54:06,230 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_51 Int) (v_prenex_50 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_50 (* 4 v_prenex_51))) (= 0 (select |c_old(#valid)| v_prenex_50))))) is different from true [2018-03-23 11:54:06,242 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,243 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:06,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:54:06,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:06,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:54:06,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:48, output treesize:72 [2018-03-23 11:54:06,436 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 8 treesize of output 7 [2018-03-23 11:54:06,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:06,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:06,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:54:06,463 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_56 Int) (v_prenex_57 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_56 (* 4 v_prenex_57))) (= 0 (select |c_old(#valid)| v_prenex_56))))) is different from true [2018-03-23 11:54:06,476 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,476 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:06,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:54:06,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:06,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:54:06,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:48, output treesize:72 [2018-03-23 11:54:06,688 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 8 treesize of output 7 [2018-03-23 11:54:06,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:06,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:06,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:54:06,704 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_63 Int) (v_prenex_62 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_62)) (= |c_#length| (store |c_old(#length)| v_prenex_62 (* 4 v_prenex_63)))))) is different from true [2018-03-23 11:54:06,718 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:54:06,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:06,753 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,754 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:06,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:54:06,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:48, output treesize:72 [2018-03-23 11:54:06,955 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 8 treesize of output 7 [2018-03-23 11:54:06,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:06,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:06,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:54:06,977 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_69 Int) (v_prenex_68 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_68)) (= (store |c_old(#length)| v_prenex_68 (* 4 v_prenex_69)) |c_#length|)))) is different from true [2018-03-23 11:54:06,986 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,986 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:06,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:06,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:07,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:54:07,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:07,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:54:07,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:48, output treesize:72 [2018-03-23 11:54:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 1110 trivial. 56 not checked. [2018-03-23 11:54:07,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:07,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25] total 55 [2018-03-23 11:54:07,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-03-23 11:54:07,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-03-23 11:54:07,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2139, Unknown=6, NotChecked=606, Total=3080 [2018-03-23 11:54:07,422 INFO L87 Difference]: Start difference. First operand 419 states and 428 transitions. Second operand 56 states. [2018-03-23 11:54:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:08,548 INFO L93 Difference]: Finished difference Result 426 states and 436 transitions. [2018-03-23 11:54:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-03-23 11:54:08,548 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 345 [2018-03-23 11:54:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:08,550 INFO L225 Difference]: With dead ends: 426 [2018-03-23 11:54:08,550 INFO L226 Difference]: Without dead ends: 425 [2018-03-23 11:54:08,551 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 328 SyntacticMatches, 11 SemanticMatches, 69 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=550, Invalid=3628, Unknown=6, NotChecked=786, Total=4970 [2018-03-23 11:54:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-03-23 11:54:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2018-03-23 11:54:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-03-23 11:54:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 432 transitions. [2018-03-23 11:54:08,604 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 432 transitions. Word has length 345 [2018-03-23 11:54:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:08,604 INFO L459 AbstractCegarLoop]: Abstraction has 422 states and 432 transitions. [2018-03-23 11:54:08,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-03-23 11:54:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 432 transitions. [2018-03-23 11:54:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-03-23 11:54:08,606 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:08,606 INFO L353 BasicCegarLoop]: trace histogram [15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 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] [2018-03-23 11:54:08,606 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:54:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1738699844, now seen corresponding path program 3 times [2018-03-23 11:54:08,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:08,607 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:08,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:08,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:08,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:08,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1166 trivial. 0 not checked. [2018-03-23 11:54:08,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:08,869 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:08,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 11:54:09,073 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-03-23 11:54:09,073 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:09,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 600 proven. 56 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-03-23 11:54:09,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:09,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 29 [2018-03-23 11:54:09,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-03-23 11:54:09,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-03-23 11:54:09,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-03-23 11:54:09,359 INFO L87 Difference]: Start difference. First operand 422 states and 432 transitions. Second operand 29 states. [2018-03-23 11:54:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:10,251 INFO L93 Difference]: Finished difference Result 528 states and 546 transitions. [2018-03-23 11:54:10,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-03-23 11:54:10,251 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 361 [2018-03-23 11:54:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:10,253 INFO L225 Difference]: With dead ends: 528 [2018-03-23 11:54:10,253 INFO L226 Difference]: Without dead ends: 516 [2018-03-23 11:54:10,254 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=571, Invalid=3211, Unknown=0, NotChecked=0, Total=3782 [2018-03-23 11:54:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-03-23 11:54:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 491. [2018-03-23 11:54:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-03-23 11:54:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 506 transitions. [2018-03-23 11:54:10,304 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 506 transitions. Word has length 361 [2018-03-23 11:54:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:10,304 INFO L459 AbstractCegarLoop]: Abstraction has 491 states and 506 transitions. [2018-03-23 11:54:10,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-03-23 11:54:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 506 transitions. [2018-03-23 11:54:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-03-23 11:54:10,308 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:10,308 INFO L353 BasicCegarLoop]: trace histogram [20, 20, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:10,308 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:54:10,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1490102782, now seen corresponding path program 8 times [2018-03-23 11:54:10,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:10,309 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:10,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:10,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:10,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:10,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 522 proven. 91 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2018-03-23 11:54:10,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:11,026 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:11,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:54:11,123 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:54:11,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:11,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 557 proven. 56 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2018-03-23 11:54:11,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:11,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-03-23 11:54:11,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-03-23 11:54:11,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-03-23 11:54:11,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2018-03-23 11:54:11,508 INFO L87 Difference]: Start difference. First operand 491 states and 506 transitions. Second operand 35 states. [2018-03-23 11:54:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:12,151 INFO L93 Difference]: Finished difference Result 704 states and 733 transitions. [2018-03-23 11:54:12,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-03-23 11:54:12,151 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 445 [2018-03-23 11:54:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:12,153 INFO L225 Difference]: With dead ends: 704 [2018-03-23 11:54:12,154 INFO L226 Difference]: Without dead ends: 558 [2018-03-23 11:54:12,155 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=2928, Unknown=0, NotChecked=0, Total=3422 [2018-03-23 11:54:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-03-23 11:54:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 489. [2018-03-23 11:54:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-03-23 11:54:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 502 transitions. [2018-03-23 11:54:12,206 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 502 transitions. Word has length 445 [2018-03-23 11:54:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:12,207 INFO L459 AbstractCegarLoop]: Abstraction has 489 states and 502 transitions. [2018-03-23 11:54:12,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-03-23 11:54:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 502 transitions. [2018-03-23 11:54:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-03-23 11:54:12,209 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:12,209 INFO L353 BasicCegarLoop]: trace histogram [21, 20, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:12,210 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:54:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash 643680051, now seen corresponding path program 9 times [2018-03-23 11:54:12,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:12,210 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:12,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:12,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:12,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:12,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2404 backedges. 980 proven. 113 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2018-03-23 11:54:12,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:12,926 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:12,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 11:54:13,269 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-03-23 11:54:13,270 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:13,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2404 backedges. 1123 proven. 274 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2018-03-23 11:54:13,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:13,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 46 [2018-03-23 11:54:13,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-03-23 11:54:13,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-03-23 11:54:13,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1871, Unknown=0, NotChecked=0, Total=2070 [2018-03-23 11:54:13,822 INFO L87 Difference]: Start difference. First operand 489 states and 502 transitions. Second operand 46 states. [2018-03-23 11:54:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:15,313 INFO L93 Difference]: Finished difference Result 868 states and 912 transitions. [2018-03-23 11:54:15,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-03-23 11:54:15,314 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 453 [2018-03-23 11:54:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:15,317 INFO L225 Difference]: With dead ends: 868 [2018-03-23 11:54:15,317 INFO L226 Difference]: Without dead ends: 661 [2018-03-23 11:54:15,319 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2455 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=971, Invalid=7771, Unknown=0, NotChecked=0, Total=8742 [2018-03-23 11:54:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-03-23 11:54:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 570. [2018-03-23 11:54:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-03-23 11:54:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 593 transitions. [2018-03-23 11:54:15,410 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 593 transitions. Word has length 453 [2018-03-23 11:54:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:15,411 INFO L459 AbstractCegarLoop]: Abstraction has 570 states and 593 transitions. [2018-03-23 11:54:15,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-03-23 11:54:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 593 transitions. [2018-03-23 11:54:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-03-23 11:54:15,415 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:15,415 INFO L353 BasicCegarLoop]: trace histogram [21, 21, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:15,415 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:54:15,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1823280408, now seen corresponding path program 10 times [2018-03-23 11:54:15,416 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:15,416 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:15,417 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:15,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:15,417 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:15,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 339 proven. 776 refuted. 0 times theorem prover too weak. 1413 trivial. 0 not checked. [2018-03-23 11:54:17,476 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:17,476 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:17,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-03-23 11:54:17,797 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-03-23 11:54:17,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:17,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:17,832 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:54:17,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:17,845 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:54:17,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:17,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:17,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-23 11:54:17,910 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-03-23 11:54:17,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:17,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:17,918 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 8 treesize of output 7 [2018-03-23 11:54:17,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:17,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:17,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:54:17,963 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_74 Int) (v_prenex_75 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_74 (* 4 v_prenex_75))) (= 0 (select |c_old(#valid)| v_prenex_74))))) is different from true [2018-03-23 11:54:17,976 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:17,977 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:17,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:17,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:18,005 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 14 treesize of output 17 [2018-03-23 11:54:18,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:18,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:18,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:37, output treesize:30 [2018-03-23 11:54:18,176 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 8 treesize of output 7 [2018-03-23 11:54:18,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:18,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:18,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:18,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:18,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:54:18,193 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_77 Int) (v_prenex_76 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_76)) (= (store |c_old(#length)| v_prenex_76 (* 4 v_prenex_77)) |c_#length|)))) is different from true [2018-03-23 11:54:18,204 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:18,205 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:18,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:18,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:18,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:54:18,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:18,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:54:18,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-03-23 11:54:18,435 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 8 treesize of output 7 [2018-03-23 11:54:18,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:18,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:18,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:18,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:18,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:54:18,467 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_83 Int) (v_prenex_82 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_82)) (= |c_#length| (store |c_old(#length)| v_prenex_82 (* 4 v_prenex_83)))))) is different from true [2018-03-23 11:54:18,477 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:18,478 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:18,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:18,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:18,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:54:18,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:18,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:54:18,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-03-23 11:54:19,037 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 8 treesize of output 7 [2018-03-23 11:54:19,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:19,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:19,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:19,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:19,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:54:19,059 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_89 Int) (v_prenex_88 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_88)) (= (store |c_old(#length)| v_prenex_88 (* 4 v_prenex_89)) |c_#length|)))) is different from true [2018-03-23 11:54:19,074 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:19,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:54:19,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:19,298 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:19,305 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:19,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:19,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:19,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:54:19,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-03-23 11:54:19,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:19,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:19,603 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 8 treesize of output 7 [2018-03-23 11:54:19,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:19,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:19,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:54:19,624 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_95 Int) (v_prenex_94 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_94 (* 4 v_prenex_95))) (= 0 (select |c_old(#valid)| v_prenex_94))))) is different from true [2018-03-23 11:54:19,640 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:19,648 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:19,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:19,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:19,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:54:19,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:19,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:54:19,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-03-23 11:54:19,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:19,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:19,943 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 8 treesize of output 7 [2018-03-23 11:54:19,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:19,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:19,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-03-23 11:54:20,001 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_101 Int) (v_prenex_100 Int)) (and (= |c_#length| (store |c_old(#length)| v_prenex_100 (* 4 v_prenex_101))) (= 0 (select |c_old(#valid)| v_prenex_100))))) is different from true [2018-03-23 11:54:20,019 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:20,020 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:20,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:20,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:20,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-03-23 11:54:20,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:20,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-03-23 11:54:20,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-03-23 11:54:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 1830 trivial. 583 not checked. [2018-03-23 11:54:20,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:20,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30] total 64 [2018-03-23 11:54:20,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-03-23 11:54:20,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-03-23 11:54:20,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=2936, Unknown=9, NotChecked=826, Total=4160 [2018-03-23 11:54:20,730 INFO L87 Difference]: Start difference. First operand 570 states and 593 transitions. Second operand 65 states. [2018-03-23 11:54:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:22,493 INFO L93 Difference]: Finished difference Result 577 states and 601 transitions. [2018-03-23 11:54:22,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-03-23 11:54:22,494 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 461 [2018-03-23 11:54:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:22,496 INFO L225 Difference]: With dead ends: 577 [2018-03-23 11:54:22,496 INFO L226 Difference]: Without dead ends: 576 [2018-03-23 11:54:22,497 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 441 SyntacticMatches, 12 SemanticMatches, 83 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2648 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=740, Invalid=5285, Unknown=9, NotChecked=1106, Total=7140 [2018-03-23 11:54:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-03-23 11:54:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 573. [2018-03-23 11:54:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-03-23 11:54:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 597 transitions. [2018-03-23 11:54:22,560 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 597 transitions. Word has length 461 [2018-03-23 11:54:22,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:22,561 INFO L459 AbstractCegarLoop]: Abstraction has 573 states and 597 transitions. [2018-03-23 11:54:22,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-03-23 11:54:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 597 transitions. [2018-03-23 11:54:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-03-23 11:54:22,564 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:22,564 INFO L353 BasicCegarLoop]: trace histogram [21, 21, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 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] [2018-03-23 11:54:22,565 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-03-23 11:54:22,565 INFO L82 PathProgramCache]: Analyzing trace with hash 789776254, now seen corresponding path program 4 times [2018-03-23 11:54:22,565 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:22,565 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:22,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:22,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:22,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:22,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2560 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 2413 trivial. 0 not checked. [2018-03-23 11:54:22,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:22,969 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:22,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-03-23 11:54:23,115 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-03-23 11:54:23,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:23,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:23,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-23 11:54:23,170 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 12 treesize of output 11 [2018-03-23 11:54:23,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-03-23 11:54:23,268 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#memory_int| (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|))))) is different from true [2018-03-23 11:54:23,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:23,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-03-23 11:54:23,279 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 12 treesize of output 11 [2018-03-23 11:54:23,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,280 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,282 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:21, output treesize:1 [2018-03-23 11:54:23,292 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:23,293 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:23,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:23,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-03-23 11:54:23,305 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 12 treesize of output 11 [2018-03-23 11:54:23,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,315 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:36, output treesize:11 [2018-03-23 11:54:23,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-03-23 11:54:23,336 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:23,337 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 18 treesize of output 27 [2018-03-23 11:54:23,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-03-23 11:54:23,432 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_106 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#memory_int| (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| v_prenex_106) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|))))) is different from true [2018-03-23 11:54:23,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:23,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-03-23 11:54:23,444 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-03-23 11:54:23,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-03-23 11:54:23,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:23,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 11:54:23,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 11:54:23,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,477 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:24, output treesize:1 [2018-03-23 11:54:23,497 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:23,502 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:23,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:23,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-03-23 11:54:23,523 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-03-23 11:54:23,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-03-23 11:54:23,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:23,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 11:54:23,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 11:54:23,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,571 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:39, output treesize:11 [2018-03-23 11:54:23,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-03-23 11:54:23,607 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:23,608 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 18 treesize of output 27 [2018-03-23 11:54:23,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-03-23 11:54:23,715 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_109 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int) (v_prenex_107 Int) (v_prenex_108 Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| v_prenex_107) (+ |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| (* 4 v_prenex_108)) v_prenex_109) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|))) is different from true [2018-03-23 11:54:23,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:23,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-03-23 11:54:23,736 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-03-23 11:54:23,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2018-03-23 11:54:23,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 42 [2018-03-23 11:54:23,754 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:23,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 62 [2018-03-23 11:54:23,794 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-03-23 11:54:23,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-23 11:54:23,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-23 11:54:23,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-23 11:54:23,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,915 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:31, output treesize:1 [2018-03-23 11:54:23,936 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:23,937 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:23,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:23,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:23,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-03-23 11:54:23,951 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-03-23 11:54:23,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2018-03-23 11:54:23,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 62 [2018-03-23 11:54:23,981 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-03-23 11:54:24,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 42 [2018-03-23 11:54:24,030 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:24,061 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-23 11:54:24,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-23 11:54:24,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-23 11:54:24,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:24,155 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:46, output treesize:11 [2018-03-23 11:54:24,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-03-23 11:54:24,179 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:24,180 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 18 treesize of output 27 [2018-03-23 11:54:24,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:24,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:24,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:24,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-03-23 11:54:24,326 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_116 Int) (v_prenex_114 Int) (v_prenex_115 Int) (v_prenex_113 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int) (v_prenex_107 Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| v_prenex_107) (+ (* 4 v_prenex_113) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_114) (+ (* 4 v_prenex_115) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_116) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|))) is different from true [2018-03-23 11:54:24,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:24,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:24,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-03-23 11:54:24,343 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-03-23 11:54:24,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-03-23 11:54:24,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 68 [2018-03-23 11:54:24,380 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:24,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 44 treesize of output 109 [2018-03-23 11:54:24,414 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 32 xjuncts. [2018-03-23 11:54:24,657 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:24,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 85 [2018-03-23 11:54:24,673 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:24,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 76 [2018-03-23 11:54:24,847 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-03-23 11:54:25,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 113 [2018-03-23 11:54:25,355 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-03-23 11:54:25,362 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 64 xjuncts. [2018-03-23 11:54:25,766 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:25,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 77 [2018-03-23 11:54:25,782 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:25,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 56 [2018-03-23 11:54:25,927 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:26,035 INFO L267 ElimStorePlain]: Start of recursive call 6: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-03-23 11:54:26,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 50 [2018-03-23 11:54:26,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 81 [2018-03-23 11:54:26,194 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 8 xjuncts. [2018-03-23 11:54:26,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 53 [2018-03-23 11:54:26,252 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:26,291 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-23 11:54:26,409 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-03-23 11:54:26,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-03-23 11:54:26,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-03-23 11:54:26,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:26,724 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 11 variables, input treesize:38, output treesize:1 [2018-03-23 11:54:26,738 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:26,739 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:26,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:54:26,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:26,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-03-23 11:54:26,755 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-03-23 11:54:26,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-03-23 11:54:26,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 68 [2018-03-23 11:54:26,793 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:26,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 77 [2018-03-23 11:54:26,807 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:27,003 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 11:54:27,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 104 [2018-03-23 11:54:27,031 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 16 xjuncts. [2018-03-23 11:54:27,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 113 [2018-03-23 11:54:27,249 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-03-23 11:54:27,254 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 64 xjuncts. [2018-03-23 11:54:27,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 84 [2018-03-23 11:54:27,807 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-03-23 11:54:27,973 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:27,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 85 [2018-03-23 11:54:27,987 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:28,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 56 [2018-03-23 11:54:28,128 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:28,238 INFO L267 ElimStorePlain]: Start of recursive call 6: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-03-23 11:54:28,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 50 [2018-03-23 11:54:28,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 81 [2018-03-23 11:54:28,382 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 8 xjuncts. [2018-03-23 11:54:28,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 53 [2018-03-23 11:54:28,438 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:28,475 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-23 11:54:28,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-03-23 11:54:28,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-03-23 11:54:28,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-03-23 11:54:28,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-23 11:54:28,987 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 11 variables, input treesize:53, output treesize:23 [2018-03-23 11:54:29,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-03-23 11:54:29,017 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:29,018 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 18 treesize of output 27 [2018-03-23 11:54:29,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:29,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:29,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:29,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-03-23 11:54:29,327 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_138 Int) (v_prenex_139 Int) (v_prenex_114 Int) (v_prenex_113 Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1 Int) (v_prenex_141 Int) (v_prenex_140 Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3| Int) (|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| Int) (v_prenex_107 Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= (store |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (store (store (store (store (store (select |c_old(#memory_int)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset| v_prenex_107) (+ (* 4 v_prenex_113) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_114) (+ (* 4 v_prenex_138) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_139) (+ (* 4 v_prenex_140) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) v_prenex_141) (+ (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.offset|) |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#t~mem3|)) |c_#memory_int|))) is different from true [2018-03-23 11:54:29,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:54:29,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:29,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-03-23 11:54:29,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-03-23 11:54:29,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2018-03-23 11:54:29,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 75 [2018-03-23 11:54:29,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 64 [2018-03-23 11:54:29,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 67 [2018-03-23 11:54:29,400 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:29,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 95 [2018-03-23 11:54:29,450 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-03-23 11:54:29,512 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-23 11:54:29,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 90 [2018-03-23 11:54:29,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 70 [2018-03-23 11:54:29,693 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:29,815 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:29,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 103 [2018-03-23 11:54:29,831 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:29,975 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:30,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 135 [2018-03-23 11:54:30,011 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 32 xjuncts. [2018-03-23 11:54:30,485 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:30,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 103 [2018-03-23 11:54:30,500 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:30,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 139 [2018-03-23 11:54:30,717 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-03-23 11:54:30,724 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 64 xjuncts. [2018-03-23 11:54:31,422 INFO L267 ElimStorePlain]: Start of recursive call 10: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-03-23 11:54:31,723 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 11:54:31,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 108 [2018-03-23 11:54:31,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 70 [2018-03-23 11:54:31,765 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-03-23 11:54:32,023 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 11:54:32,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 146 [2018-03-23 11:54:32,066 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-03-23 11:54:32,068 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 32 xjuncts. [2018-03-23 11:54:32,726 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:32,727 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:32,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 70 treesize of output 139 [2018-03-23 11:54:32,755 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 16 xjuncts. [2018-03-23 11:54:34,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 98 [2018-03-23 11:54:34,012 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 8 xjuncts. [2018-03-23 11:54:34,631 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 11:54:34,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 126 [2018-03-23 11:54:34,660 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 16 xjuncts. [2018-03-23 11:54:35,334 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 11:54:35,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 118 [2018-03-23 11:54:35,364 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 16 xjuncts. [2018-03-23 11:54:36,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 48 treesize of output 171 [2018-03-23 11:54:36,669 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-03-23 11:54:36,688 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 128 xjuncts. [2018-03-23 11:54:38,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 118 [2018-03-23 11:54:38,210 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 16 xjuncts. [2018-03-23 11:54:38,916 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:38,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 103 [2018-03-23 11:54:38,931 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:39,559 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:39,561 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:39,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 127 [2018-03-23 11:54:39,585 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 8 xjuncts. [2018-03-23 11:54:40,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 90 [2018-03-23 11:54:40,210 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 8 xjuncts. [2018-03-23 11:54:41,330 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:41,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 135 [2018-03-23 11:54:41,364 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 32 xjuncts. [2018-03-23 11:54:42,499 INFO L267 ElimStorePlain]: Start of recursive call 16: 16 dim-1 vars, End of recursive call: and 35 xjuncts. [2018-03-23 11:54:43,939 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:43,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 83 [2018-03-23 11:54:43,957 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:43,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 96 [2018-03-23 11:54:43,973 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:44,100 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:44,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 128 [2018-03-23 11:54:44,133 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 32 xjuncts. [2018-03-23 11:54:44,327 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:44,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 96 [2018-03-23 11:54:44,342 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:44,454 INFO L267 ElimStorePlain]: Start of recursive call 29: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-03-23 11:54:45,214 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:45,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 91 [2018-03-23 11:54:45,232 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:45,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 108 [2018-03-23 11:54:45,248 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:45,330 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:45,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 132 [2018-03-23 11:54:45,365 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 32 xjuncts. [2018-03-23 11:54:45,557 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:45,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 100 [2018-03-23 11:54:45,572 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:45,791 INFO L267 ElimStorePlain]: Start of recursive call 33: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-03-23 11:54:47,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 117 [2018-03-23 11:54:47,230 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-03-23 11:54:47,236 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-03-23 11:54:47,236 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:49,193 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:49,199 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 11:54:49,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 130 [2018-03-23 11:54:49,226 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 16 xjuncts. [2018-03-23 11:54:51,249 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:51,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 94 [2018-03-23 11:54:51,269 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-03-23 11:54:53,118 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:53,119 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:53,126 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 11:54:53,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 127 [2018-03-23 11:54:53,147 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 8 xjuncts. [2018-03-23 11:54:56,974 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:56,975 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:56,989 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 11:54:57,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 68 treesize of output 163 [2018-03-23 11:54:57,030 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-03-23 11:54:57,035 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 64 xjuncts. [2018-03-23 11:54:59,782 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:59,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 102 [2018-03-23 11:54:59,797 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 4 xjuncts. [2018-03-23 11:55:04,140 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 11:55:04,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 118 [2018-03-23 11:55:04,169 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 16 xjuncts. [2018-03-23 11:55:08,519 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:55:08,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 91 [2018-03-23 11:55:08,537 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 4 xjuncts. Received shutdown request... [2018-03-23 11:55:08,677 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-03-23 11:55:08,677 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-23 11:55:08,681 WARN L197 ceAbstractionStarter]: Timeout [2018-03-23 11:55:08,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 11:55:08 BoogieIcfgContainer [2018-03-23 11:55:08,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-23 11:55:08,682 INFO L168 Benchmark]: Toolchain (without parser) took 112000.12 ms. Allocated memory was 304.6 MB in the beginning and 1.2 GB in the end (delta: 893.9 MB). Free memory was 250.7 MB in the beginning and 779.9 MB in the end (delta: -529.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-03-23 11:55:08,683 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-23 11:55:08,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.08 ms. Allocated memory is still 304.6 MB. Free memory was 250.7 MB in the beginning and 240.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-03-23 11:55:08,683 INFO L168 Benchmark]: Boogie Preprocessor took 34.16 ms. Allocated memory is still 304.6 MB. Free memory was 240.6 MB in the beginning and 238.6 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:55:08,683 INFO L168 Benchmark]: RCFGBuilder took 405.80 ms. Allocated memory was 304.6 MB in the beginning and 465.6 MB in the end (delta: 161.0 MB). Free memory was 238.6 MB in the beginning and 427.0 MB in the end (delta: -188.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-03-23 11:55:08,684 INFO L168 Benchmark]: TraceAbstraction took 111356.26 ms. Allocated memory was 465.6 MB in the beginning and 1.2 GB in the end (delta: 733.0 MB). Free memory was 427.0 MB in the beginning and 779.9 MB in the end (delta: -352.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-03-23 11:55:08,685 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.18 ms. Allocated memory is still 304.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.08 ms. Allocated memory is still 304.6 MB. Free memory was 250.7 MB in the beginning and 240.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.16 ms. Allocated memory is still 304.6 MB. Free memory was 240.6 MB in the beginning and 238.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 405.80 ms. Allocated memory was 304.6 MB in the beginning and 465.6 MB in the end (delta: 161.0 MB). Free memory was 238.6 MB in the beginning and 427.0 MB in the end (delta: -188.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 111356.26 ms. Allocated memory was 465.6 MB in the beginning and 1.2 GB in the end (delta: 733.0 MB). Free memory was 427.0 MB in the beginning and 779.9 MB in the end (delta: -352.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 14). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 392. - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 14). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 392. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 392. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 392. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 392. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 392. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 392. - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 392. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 392. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 392. - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 392. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 89 locations, 11 error locations. TIMEOUT Result, 111.3s OverallTime, 38 OverallIterations, 21 TraceHistogramMax, 33.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2959 SDtfs, 7861 SDslu, 28662 SDs, 0 SdLazy, 23208 SolverSat, 1412 SolverUnsat, 133 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6683 GetRequests, 5213 SyntacticMatches, 51 SemanticMatches, 1419 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 26685 ImplicationChecksByTransitivity, 31.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=573occurred in iteration=37, 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: 1.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 857 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 25.2s InterpolantComputationTime, 11285 NumberOfCodeBlocks, 11036 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 11221 ConstructedInterpolants, 1285 QuantifiedInterpolants, 14610515 SizeOfPredicates, 335 NumberOfNonLiveVariables, 12562 ConjunctsInSsa, 706 ConjunctsInUnsatCore, 64 InterpolantComputations, 12 PerfectInterpolantSequences, 26890/30731 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-23_11-55-08-692.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-23_11-55-08-692.csv Completed graceful shutdown