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 --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 18:37:46,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 18:37:46,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 18:37:46,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 18:37:46,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 18:37:46,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 18:37:46,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 18:37:46,607 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 18:37:46,609 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 18:37:46,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 18:37:46,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 18:37:46,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 18:37:46,612 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 18:37:46,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 18:37:46,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 18:37:46,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 18:37:46,616 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 18:37:46,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 18:37:46,619 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 18:37:46,620 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 18:37:46,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 18:37:46,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 18:37:46,622 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 18:37:46,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 18:37:46,624 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 18:37:46,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 18:37:46,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 18:37:46,625 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 18:37:46,626 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 18:37:46,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 18:37:46,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 18:37:46,627 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-04-11 18:37:46,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 18:37:46,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 18:37:46,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 18:37:46,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 18:37:46,648 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 18:37:46,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 18:37:46,648 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 18:37:46,648 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 18:37:46,648 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 18:37:46,649 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 18:37:46,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 18:37:46,649 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 18:37:46,649 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 18:37:46,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 18:37:46,649 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 18:37:46,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 18:37:46,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 18:37:46,650 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 18:37:46,650 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 18:37:46,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 18:37:46,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 18:37:46,650 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-04-11 18:37:46,650 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-04-11 18:37:46,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 18:37:46,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 18:37:46,685 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 18:37:46,687 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 18:37:46,688 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 18:37:46,688 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 18:37:46,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 18:37:47,038 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGaf58f3eab [2018-04-11 18:37:47,126 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 18:37:47,126 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 18:37:47,126 INFO L168 CDTParser]: Scanning test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 18:37:47,127 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 18:37:47,128 INFO L215 ultiparseSymbolTable]: [2018-04-11 18:37:47,128 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 18:37:47,128 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 18:37:47,128 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 18:37:47,128 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 18:37:47,128 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 18:37:47,140 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGaf58f3eab [2018-04-11 18:37:47,143 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 18:37:47,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 18:37:47,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 18:37:47,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 18:37:47,149 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 18:37:47,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 06:37:47" (1/1) ... [2018-04-11 18:37:47,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760c5fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:37:47, skipping insertion in model container [2018-04-11 18:37:47,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 06:37:47" (1/1) ... [2018-04-11 18:37:47,162 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 18:37:47,171 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 18:37:47,266 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 18:37:47,289 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 18:37:47,295 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 18:37:47,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:37:47 WrapperNode [2018-04-11 18:37:47,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 18:37:47,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 18:37:47,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 18:37:47,306 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 18:37:47,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:37:47" (1/1) ... [2018-04-11 18:37:47,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:37:47" (1/1) ... [2018-04-11 18:37:47,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:37:47" (1/1) ... [2018-04-11 18:37:47,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:37:47" (1/1) ... [2018-04-11 18:37:47,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:37:47" (1/1) ... [2018-04-11 18:37:47,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:37:47" (1/1) ... [2018-04-11 18:37:47,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:37:47" (1/1) ... [2018-04-11 18:37:47,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 18:37:47,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 18:37:47,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 18:37:47,336 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 18:37:47,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:37:47" (1/1) ... No working directory specified, using /home/ultimate/work/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-04-11 18:37:47,378 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 18:37:47,378 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 18:37:47,379 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 18:37:47,379 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 18:37:47,379 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 18:37:47,379 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 18:37:47,379 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 18:37:47,379 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 18:37:47,379 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 18:37:47,379 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 18:37:47,380 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 18:37:47,380 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 18:37:47,380 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 18:37:47,380 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 18:37:47,380 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 18:37:47,380 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 18:37:47,702 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 18:37:47,710 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 18:37:47,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 06:37:47 BoogieIcfgContainer [2018-04-11 18:37:47,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 18:37:47,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 18:37:47,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 18:37:47,714 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 18:37:47,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 06:37:47" (1/3) ... [2018-04-11 18:37:47,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fe060d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 06:37:47, skipping insertion in model container [2018-04-11 18:37:47,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 06:37:47" (2/3) ... [2018-04-11 18:37:47,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fe060d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 06:37:47, skipping insertion in model container [2018-04-11 18:37:47,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 06:37:47" (3/3) ... [2018-04-11 18:37:47,717 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 18:37:47,724 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 18:37:47,730 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-04-11 18:37:47,761 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 18:37:47,762 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 18:37:47,762 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 18:37:47,762 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-04-11 18:37:47,762 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 18:37:47,762 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 18:37:47,763 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 18:37:47,763 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 18:37:47,763 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 18:37:47,763 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 18:37:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2018-04-11 18:37:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 18:37:47,779 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:37:47,780 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:37:47,780 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 18:37:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2048667359, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:37:47,789 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:37:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:47,821 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier [2018-04-11 18:37:47,862 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:47,862 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:47,864 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:47,864 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:47,995 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 39 DAG size of output 36 [2018-04-11 18:37:48,007 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 32 treesize of output 31 [2018-04-11 18:37:48,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:48,010 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 21 treesize of output 20 [2018-04-11 18:37:48,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:48,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:37:48,073 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 2 case distinctions, treesize of input 23 treesize of output 29 [2018-04-11 18:37:48,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 18:37:48,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 18:37:48,091 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:141, output treesize:30 [2018-04-11 18:37:50,130 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:50,131 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:50,131 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:50,131 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:50,249 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 39 DAG size of output 38 [2018-04-11 18:37:50,252 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 32 treesize of output 31 [2018-04-11 18:37:50,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:50,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 21 treesize of output 20 [2018-04-11 18:37:50,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:50,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 18:37:50,292 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 2 case distinctions, treesize of input 23 treesize of output 29 [2018-04-11 18:37:50,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 18:37:50,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 18:37:50,325 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:141, output treesize:30 [2018-04-11 18:37:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:52,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:37:52,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 18:37:52,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:37:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:52,287 INFO L182 omatonBuilderFactory]: Interpolants [112#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 113#(= |old(#length)| |#length|), 98#true, 114#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| 0) (= |#length| (store |old(#length)| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| 5)) (= (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|) 1)), 99#false, 109#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 5 (select |#length| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|))), 110#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| 0) (forall ((%0 Int)) (or (= 5 (select (store |#length| %0 4) |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)) (= %0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|))) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|))), 111#(and (<= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 5 (select |#length| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)) (<= (+ |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| 1) (select |#length| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)))] [2018-04-11 18:37:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:52,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 18:37:52,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 18:37:52,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=35, Unknown=2, NotChecked=0, Total=56 [2018-04-11 18:37:52,301 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 8 states. [2018-04-11 18:37:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:37:52,638 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2018-04-11 18:37:52,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 18:37:52,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-04-11 18:37:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:37:52,648 INFO L225 Difference]: With dead ends: 127 [2018-04-11 18:37:52,648 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 18:37:52,650 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=35, Invalid=53, Unknown=2, NotChecked=0, Total=90 [2018-04-11 18:37:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 18:37:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 80. [2018-04-11 18:37:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-11 18:37:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-04-11 18:37:52,674 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 15 [2018-04-11 18:37:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:37:52,675 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-04-11 18:37:52,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 18:37:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-04-11 18:37:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 18:37:52,676 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:37:52,676 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:37:52,676 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 18:37:52,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1967781157, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:37:52,687 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:37:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:52,704 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: W [2018-04-11 18:37:52,708 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: ARNING: array quantifier [2018-04-11 18:37:52,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:52,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:52,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:52,709 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:52,713 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |c_#length| %1 4)) :qid itp)) :qid itp)) is different from true [2018-04-11 18:37:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:52,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:37:52,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:37:52,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:37:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:52,762 INFO L182 omatonBuilderFactory]: Interpolants [337#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store %0 %1 4) (store |#length| %1 4)) :qid itp)) :qid itp)), 338#(and (= 0 |main_#t~malloc0.offset|) (= 4 (select |#length| |main_#t~malloc0.base|))), 339#(and (<= 0 main_~p~0.offset) (<= (+ main_~p~0.offset 4) (select |#length| main_~p~0.base))), 340#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 326#true, 327#false] [2018-04-11 18:37:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:52,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:37:52,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:37:52,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-04-11 18:37:52,764 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 6 states. [2018-04-11 18:37:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:37:52,911 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2018-04-11 18:37:52,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 18:37:52,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-04-11 18:37:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:37:52,914 INFO L225 Difference]: With dead ends: 78 [2018-04-11 18:37:52,914 INFO L226 Difference]: Without dead ends: 78 [2018-04-11 18:37:52,914 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=27, Unknown=3, NotChecked=10, Total=56 [2018-04-11 18:37:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-11 18:37:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2018-04-11 18:37:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 18:37:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-04-11 18:37:52,920 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 20 [2018-04-11 18:37:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:37:52,920 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-04-11 18:37:52,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:37:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-04-11 18:37:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 18:37:52,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:37:52,921 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 18:37:52,921 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 18:37:52,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1967781159, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:37:52,925 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:37:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:52,937 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier [2018-04-11 18:37:52,939 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:52,940 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:52,940 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:52,940 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:52,943 WARN L1033 $PredicateComparison]: unable to prove that (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) is different from true [2018-04-11 18:37:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:52,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:37:52,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 18:37:52,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:37:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:52,984 INFO L182 omatonBuilderFactory]: Interpolants [512#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 498#true, 499#false, 509#(exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)), 510#(= 1 (select |#valid| |main_#t~malloc0.base|)), 511#(= 1 (select |#valid| main_~p~0.base))] [2018-04-11 18:37:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:52,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 18:37:52,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 18:37:52,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-04-11 18:37:52,985 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2018-04-11 18:37:53,000 WARN L1011 $PredicateComparison]: unable to prove that (and (exists ((%0 (Array Int Int))) (! (forall ((%1 Int)) (! (= (store |c_#valid| %1 1) (store %0 %1 1)) :qid itp)) :qid itp)) (= |c_~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |c_old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |c_#valid| |c_old(#valid)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#memory_int| |c_old(#memory_int)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(#length)| |c_#length|) (= |c_~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |c_old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)) is different from false [2018-04-11 18:37:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:37:53,119 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-04-11 18:37:53,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 18:37:53,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-04-11 18:37:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:37:53,120 INFO L225 Difference]: With dead ends: 108 [2018-04-11 18:37:53,120 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 18:37:53,121 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=21, Unknown=2, NotChecked=18, Total=56 [2018-04-11 18:37:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 18:37:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 74. [2018-04-11 18:37:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 18:37:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-04-11 18:37:53,125 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 20 [2018-04-11 18:37:53,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:37:53,126 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-04-11 18:37:53,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 18:37:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-04-11 18:37:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 18:37:53,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:37:53,127 INFO L355 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-04-11 18:37:53,127 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 18:37:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash -585689370, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:37:53,130 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:37:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:37:53,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 18:37:53,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:37:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,234 INFO L182 omatonBuilderFactory]: Interpolants [720#(<= |#Ultimate.C_memcpy_size| 0), 710#(= 0 |main_#t~malloc0.offset|), 711#(= 0 main_~p~0.offset), 699#true, 700#false, 717#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 718#(= |#memory_int| |old(#memory_int)|), 719#(= 0 |#Ultimate.C_memcpy_#t~loopctr8|)] [2018-04-11 18:37:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 18:37:53,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 18:37:53,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 18:37:53,235 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 8 states. [2018-04-11 18:37:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:37:53,388 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-04-11 18:37:53,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 18:37:53,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-11 18:37:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:37:53,390 INFO L225 Difference]: With dead ends: 71 [2018-04-11 18:37:53,391 INFO L226 Difference]: Without dead ends: 69 [2018-04-11 18:37:53,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-04-11 18:37:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-11 18:37:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-04-11 18:37:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 18:37:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-04-11 18:37:53,395 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 29 [2018-04-11 18:37:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:37:53,396 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-04-11 18:37:53,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 18:37:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-04-11 18:37:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 18:37:53,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:37:53,397 INFO L355 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] [2018-04-11 18:37:53,397 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 18:37:53,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1008408557, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:37:53,404 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:37:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:37:53,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 18:37:53,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:37:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,500 INFO L182 omatonBuilderFactory]: Interpolants [871#true, 872#false, 888#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 889#(= |#memory_int| |old(#memory_int)|), 890#(= 0 |#Ultimate.C_memcpy_#t~loopctr8|), 891#(or (and (<= |#Ultimate.C_memcpy_size| 1) (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr8|)) (and (< |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_size|) (< 1 |#Ultimate.C_memcpy_size|))), 892#(<= |#Ultimate.C_memcpy_size| 1)] [2018-04-11 18:37:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 18:37:53,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 18:37:53,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 18:37:53,500 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 7 states. [2018-04-11 18:37:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:37:53,579 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-04-11 18:37:53,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 18:37:53,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-04-11 18:37:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:37:53,580 INFO L225 Difference]: With dead ends: 72 [2018-04-11 18:37:53,580 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 18:37:53,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-11 18:37:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 18:37:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-04-11 18:37:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 18:37:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-04-11 18:37:53,584 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 33 [2018-04-11 18:37:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:37:53,584 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-04-11 18:37:53,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 18:37:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-04-11 18:37:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 18:37:53,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:37:53,585 INFO L355 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] [2018-04-11 18:37:53,585 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 18:37:53,585 INFO L82 PathProgramCache]: Analyzing trace with hash -956628246, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:37:53,588 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:37:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:37:53,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 18:37:53,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:37:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,683 INFO L182 omatonBuilderFactory]: Interpolants [1040#false, 1057#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 1058#(= |#memory_int| |old(#memory_int)|), 1059#(= 0 |#Ultimate.C_memcpy_#t~loopctr8|), 1060#(= 1 |#Ultimate.C_memcpy_#t~loopctr8|), 1061#(or (and (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr8|) (<= |#Ultimate.C_memcpy_size| 2)) (and (< 2 |#Ultimate.C_memcpy_size|) (< |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_size|))), 1062#(<= |#Ultimate.C_memcpy_size| 2), 1039#true] [2018-04-11 18:37:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 18:37:53,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 18:37:53,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 18:37:53,683 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 8 states. [2018-04-11 18:37:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:37:53,780 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-04-11 18:37:53,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 18:37:53,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-11 18:37:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:37:53,781 INFO L225 Difference]: With dead ends: 73 [2018-04-11 18:37:53,781 INFO L226 Difference]: Without dead ends: 71 [2018-04-11 18:37:53,782 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-11 18:37:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-11 18:37:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-04-11 18:37:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-11 18:37:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-04-11 18:37:53,786 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 34 [2018-04-11 18:37:53,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:37:53,786 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-04-11 18:37:53,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 18:37:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-04-11 18:37:53,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 18:37:53,787 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:37:53,787 INFO L355 BasicCegarLoop]: trace histogram [3, 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-04-11 18:37:53,787 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 18:37:53,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1743226995, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:37:53,789 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:37:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:37:53,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 18:37:53,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:37:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,867 INFO L182 omatonBuilderFactory]: Interpolants [1232#(= 0 |#Ultimate.C_memcpy_#t~loopctr8|), 1233#(= 1 |#Ultimate.C_memcpy_#t~loopctr8|), 1234#(= 2 |#Ultimate.C_memcpy_#t~loopctr8|), 1235#(or (and (< 3 |#Ultimate.C_memcpy_size|) (< |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_size|)) (and (<= |#Ultimate.C_memcpy_size| 3) (<= |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_#t~loopctr8|))), 1236#(<= |#Ultimate.C_memcpy_size| 3), 1211#true, 1212#false, 1230#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 1231#(= |#memory_int| |old(#memory_int)|)] [2018-04-11 18:37:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:53,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 18:37:53,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 18:37:53,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 18:37:53,868 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-04-11 18:37:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:37:53,970 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-04-11 18:37:53,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 18:37:53,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-04-11 18:37:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:37:53,971 INFO L225 Difference]: With dead ends: 74 [2018-04-11 18:37:53,971 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 18:37:53,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-11 18:37:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 18:37:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-04-11 18:37:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 18:37:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-04-11 18:37:53,973 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 35 [2018-04-11 18:37:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:37:53,974 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-04-11 18:37:53,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 18:37:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-04-11 18:37:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 18:37:53,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:37:53,975 INFO L355 BasicCegarLoop]: trace histogram [4, 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-04-11 18:37:53,975 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 18:37:53,975 INFO L82 PathProgramCache]: Analyzing trace with hash -357984438, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:37:53,978 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:37:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:54,040 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier [2018-04-11 18:37:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:54,133 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier [2018-04-11 18:37:54,146 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,146 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,147 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,147 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,147 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,147 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,182 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,182 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,182 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,183 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,183 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,183 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,187 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 88 treesize of output 85 [2018-04-11 18:37:54,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 85 treesize of output 84 [2018-04-11 18:37:54,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 18:37:54,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:141, output treesize:111 [2018-04-11 18:37:54,264 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,264 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,267 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 54 treesize of output 56 [2018-04-11 18:37:54,270 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 15 [2018-04-11 18:37:54,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 57 treesize of output 56 [2018-04-11 18:37:54,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 18:37:54,296 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:71, output treesize:40 [2018-04-11 18:37:54,315 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,315 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,315 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,315 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,316 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,316 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,316 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,316 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,321 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 79 treesize of output 81 [2018-04-11 18:37:54,326 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-04-11 18:37:54,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 22 [2018-04-11 18:37:54,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,334 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 63 [2018-04-11 18:37:54,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 18:37:54,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:43 [2018-04-11 18:37:54,393 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,393 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,393 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,393 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,394 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,394 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,394 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,394 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:54,400 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 79 treesize of output 81 [2018-04-11 18:37:54,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-04-11 18:37:54,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 22 [2018-04-11 18:37:54,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,414 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 68 treesize of output 67 [2018-04-11 18:37:54,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 18:37:54,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 18:37:54,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:48 [2018-04-11 18:37:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:54,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:37:54,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 18:37:54,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:37:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:54,501 INFO L182 omatonBuilderFactory]: Interpolants [1411#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 1412#(and (<= (+ (mod |main_#t~mem2| 256) (* 256 (div |main_#t~mem2| 256))) 1) (<= 1 (+ (mod |main_#t~mem2| 256) (* 256 (div |main_#t~mem2| 256))))), 1413#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 1414#(= |#memory_int| |old(#memory_int)|), 1415#(and (= 0 |#Ultimate.C_memcpy_#t~loopctr8|) (= |#memory_int| |old(#memory_int)|)), 1416#(exists ((%0 (Array Int (Array Int Int)))) (! (forall ((%1 Int) (%2 Int)) (! (or (exists ((%4 Int) (%3 (Array Int Int))) (! (and (or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (store %0 %1 (store %3 0 %4)) (store |#memory_int| %1 (store %3 0 %4))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (= %4 1) (= %3 (select |#memory_int| %2)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 0) %4))) (= (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr8|)))) (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| 1) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| 1))))) (= |#Ultimate.C_memcpy_#t~loopctr8| 1)) :qid itp)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 1))) :qid itp)) :qid itp)), 1417#(or (and (= (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr8|)))) (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| 2))))) (= 1 (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))) (and (= (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr8|)))) (store |#memory_int| |#Ultimate.C_memcpy_dest.base| (store (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| 2))))) (not (= |#Ultimate.C_memcpy_dest.offset| 0))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 1))), 1418#(or (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2)) (= 1 (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 1))), 1387#true, 1419#(or (and (= 1 (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) |#Ultimate.C_memcpy_#t~loopctr8|) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_#t~loopctr8|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 1)) (<= |#Ultimate.C_memcpy_#t~loopctr8| 1)), 1388#false, 1420#(or (not (= |#Ultimate.C_memcpy_size| 4)) (and (not (= 0 |#Ultimate.C_memcpy_#t~loopctr8|)) (= 1 (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) |#Ultimate.C_memcpy_#t~loopctr8|) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_#t~loopctr8|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 1))), 1421#(or (not (= |#Ultimate.C_memcpy_size| 4)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0) 1) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) 1))), 1398#(= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|), 1399#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 |main_#t~malloc0.offset|)), 1400#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 main_~p~0.offset)), 1401#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 main_~p~0.offset) (= 1 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|) 0)))] [2018-04-11 18:37:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:54,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 18:37:54,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 18:37:54,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=227, Unknown=2, NotChecked=0, Total=272 [2018-04-11 18:37:54,501 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 17 states. [2018-04-11 18:37:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:37:55,109 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-04-11 18:37:55,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 18:37:55,109 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-04-11 18:37:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:37:55,110 INFO L225 Difference]: With dead ends: 113 [2018-04-11 18:37:55,110 INFO L226 Difference]: Without dead ends: 113 [2018-04-11 18:37:55,110 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=790, Unknown=6, NotChecked=0, Total=930 [2018-04-11 18:37:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-11 18:37:55,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 78. [2018-04-11 18:37:55,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 18:37:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-04-11 18:37:55,114 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 36 [2018-04-11 18:37:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:37:55,115 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-04-11 18:37:55,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 18:37:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-04-11 18:37:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 18:37:55,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:37:55,116 INFO L355 BasicCegarLoop]: trace histogram [5, 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-04-11 18:37:55,116 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 18:37:55,116 INFO L82 PathProgramCache]: Analyzing trace with hash -365138131, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:37:55,120 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 18:37:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:55,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 18:37:55,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 18:37:55,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:37:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:55,188 INFO L182 omatonBuilderFactory]: Interpolants [1664#(= 0 |#Ultimate.C_memcpy_#t~loopctr8|), 1665#(= 1 |#Ultimate.C_memcpy_#t~loopctr8|), 1666#(= 2 |#Ultimate.C_memcpy_#t~loopctr8|), 1667#(= |#Ultimate.C_memcpy_#t~loopctr8| 3), 1668#(= 4 |#Ultimate.C_memcpy_#t~loopctr8|), 1669#(not (= 4 |#Ultimate.C_memcpy_size|)), 1641#true, 1642#false, 1662#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 1663#(= |#memory_int| |old(#memory_int)|)] [2018-04-11 18:37:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:55,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 18:37:55,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 18:37:55,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-04-11 18:37:55,189 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 10 states. [2018-04-11 18:37:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:37:55,294 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-04-11 18:37:55,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 18:37:55,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-04-11 18:37:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:37:55,295 INFO L225 Difference]: With dead ends: 70 [2018-04-11 18:37:55,295 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 18:37:55,295 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-11 18:37:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 18:37:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-04-11 18:37:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 18:37:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-04-11 18:37:55,298 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 37 [2018-04-11 18:37:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:37:55,298 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-04-11 18:37:55,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 18:37:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-04-11 18:37:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 18:37:55,299 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 18:37:55,299 INFO L355 BasicCegarLoop]: trace histogram [4, 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-04-11 18:37:55,299 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 18:37:55,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1701873782, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [2018-04-11 18:37:55,306 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 18:37:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:55,401 WARN L195 Executor]: ExternalInterpolator (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in) stderr output: WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier WARNING: array quantifier [2018-04-11 18:37:55,411 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,411 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,412 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,412 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,412 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,412 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,413 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,413 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,413 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,413 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,414 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,414 WARN L251 NnfTransformerHelper]: thrown away annotations [(:qid itp)] [2018-04-11 18:37:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 18:37:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-11 18:37:55,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 18:37:55,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 18:37:55,507 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 18:37:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 18:37:55,508 INFO L182 omatonBuilderFactory]: Interpolants [1809#true, 1810#false, 1831#(= 2 (select (select |#memory_int| main_~p~0.base) (+ 1 main_~p~0.offset))), 1832#(and (<= 2 (+ (* 256 (div |main_#t~mem3| 256)) (mod |main_#t~mem3| 256))) (<= (+ (* 256 (div |main_#t~mem3| 256)) (mod |main_#t~mem3| 256)) 2)), 1833#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |old(~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base)|)), 1834#(= |#memory_int| |old(#memory_int)|), 1820#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|))), 1821#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 |main_#t~malloc0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |main_#t~malloc0.base|)))] [2018-04-11 18:37:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-11 18:37:55,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 18:37:55,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 18:37:55,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 18:37:55,509 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 8 states. [2018-04-11 18:37:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 18:37:55,587 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2018-04-11 18:37:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 18:37:55,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-04-11 18:37:55,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 18:37:55,588 INFO L225 Difference]: With dead ends: 14 [2018-04-11 18:37:55,588 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 18:37:55,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-04-11 18:37:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 18:37:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 18:37:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 18:37:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 18:37:55,588 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-04-11 18:37:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 18:37:55,589 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 18:37:55,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 18:37:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 18:37:55,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 18:37:55,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 06:37:55 BoogieIcfgContainer [2018-04-11 18:37:55,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 18:37:55,593 INFO L168 Benchmark]: Toolchain (without parser) took 8449.52 ms. Allocated memory was 402.1 MB in the beginning and 633.9 MB in the end (delta: 231.7 MB). Free memory was 337.1 MB in the beginning and 546.7 MB in the end (delta: -209.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. [2018-04-11 18:37:55,594 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 18:37:55,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.19 ms. Allocated memory is still 402.1 MB. Free memory was 337.1 MB in the beginning and 325.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 5.3 GB. [2018-04-11 18:37:55,595 INFO L168 Benchmark]: Boogie Preprocessor took 29.63 ms. Allocated memory is still 402.1 MB. Free memory was 325.8 MB in the beginning and 324.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 18:37:55,595 INFO L168 Benchmark]: RCFGBuilder took 375.21 ms. Allocated memory was 402.1 MB in the beginning and 587.7 MB in the end (delta: 185.6 MB). Free memory was 324.5 MB in the beginning and 545.6 MB in the end (delta: -221.1 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. [2018-04-11 18:37:55,596 INFO L168 Benchmark]: TraceAbstraction took 7881.49 ms. Allocated memory was 587.7 MB in the beginning and 633.9 MB in the end (delta: 46.1 MB). Free memory was 545.6 MB in the beginning and 546.7 MB in the end (delta: -1.2 MB). Peak memory consumption was 45.0 MB. Max. memory is 5.3 GB. [2018-04-11 18:37:55,598 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.15 ms. Allocated memory is still 402.1 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.19 ms. Allocated memory is still 402.1 MB. Free memory was 337.1 MB in the beginning and 325.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.63 ms. Allocated memory is still 402.1 MB. Free memory was 325.8 MB in the beginning and 324.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 375.21 ms. Allocated memory was 402.1 MB in the beginning and 587.7 MB in the end (delta: 185.6 MB). Free memory was 324.5 MB in the beginning and 545.6 MB in the end (delta: -221.1 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7881.49 ms. Allocated memory was 587.7 MB in the beginning and 633.9 MB in the end (delta: 46.1 MB). Free memory was 545.6 MB in the beginning and 546.7 MB in the end (delta: -1.2 MB). Peak memory consumption was 45.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 36]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 45]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 45]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 37 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 37 error locations. SAFE Result, 7.8s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 417 SDtfs, 759 SDslu, 1670 SDs, 0 SdLazy, 2004 SolverSat, 147 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 51 SyntacticMatches, 12 SemanticMatches, 102 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 10/45 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 116 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 287 ConstructedInterpolants, 7 QuantifiedInterpolants, 46882 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 10/45 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_18-37-55-607.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_18-37-55-607.csv Received shutdown request...