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_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 01:01:58,932 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 01:01:58,933 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 01:01:58,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 01:01:58,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 01:01:58,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 01:01:58,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 01:01:58,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 01:01:58,950 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 01:01:58,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 01:01:58,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 01:01:58,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 01:01:58,952 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 01:01:58,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 01:01:58,954 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 01:01:58,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 01:01:58,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 01:01:58,958 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 01:01:58,959 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 01:01:58,960 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 01:01:58,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 01:01:58,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 01:01:58,962 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 01:01:58,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 01:01:58,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 01:01:58,965 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 01:01:58,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 01:01:58,965 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 01:01:58,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 01:01:58,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 01:01:58,967 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 01:01:58,967 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-13 01:01:58,976 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 01:01:58,976 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 01:01:58,977 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 01:01:58,978 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 01:01:58,978 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 01:01:58,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 01:01:58,978 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 01:01:58,978 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 01:01:58,978 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 01:01:58,978 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 01:01:58,978 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 01:01:58,978 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 01:01:58,978 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 01:01:58,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 01:01:58,979 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 01:01:58,979 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 01:01:58,979 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 01:01:58,979 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 01:01:58,979 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 01:01:58,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 01:01:58,979 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 01:01:58,979 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 01:01:59,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 01:01:59,015 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 01:01:59,017 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 01:01:59,019 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 01:01:59,019 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 01:01:59,019 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_false-valid-deref.i [2018-04-13 01:01:59,310 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG64d9973ca [2018-04-13 01:01:59,404 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 01:01:59,404 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 01:01:59,405 INFO L168 CDTParser]: Scanning test-bitfields-2_false-valid-deref.i [2018-04-13 01:01:59,405 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 01:01:59,406 INFO L215 ultiparseSymbolTable]: [2018-04-13 01:01:59,406 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 01:01:59,406 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_false-valid-deref.i [2018-04-13 01:01:59,406 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 01:01:59,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-2_false-valid-deref.i [2018-04-13 01:01:59,406 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-2_false-valid-deref.i [2018-04-13 01:01:59,418 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG64d9973ca [2018-04-13 01:01:59,422 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 01:01:59,423 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 01:01:59,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 01:01:59,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 01:01:59,427 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 01:01:59,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 01:01:59" (1/1) ... [2018-04-13 01:01:59,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b4115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:59, skipping insertion in model container [2018-04-13 01:01:59,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 01:01:59" (1/1) ... [2018-04-13 01:01:59,439 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 01:01:59,448 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 01:01:59,544 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 01:01:59,564 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 01:01:59,570 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-13 01:01:59,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:59 WrapperNode [2018-04-13 01:01:59,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 01:01:59,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 01:01:59,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 01:01:59,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 01:01:59,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:59" (1/1) ... [2018-04-13 01:01:59,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:59" (1/1) ... [2018-04-13 01:01:59,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:59" (1/1) ... [2018-04-13 01:01:59,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:59" (1/1) ... [2018-04-13 01:01:59,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:59" (1/1) ... [2018-04-13 01:01:59,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:59" (1/1) ... [2018-04-13 01:01:59,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:59" (1/1) ... [2018-04-13 01:01:59,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 01:01:59,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 01:01:59,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 01:01:59,612 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 01:01:59,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:59" (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-13 01:01:59,647 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 01:01:59,648 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 01:01:59,648 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 01:01:59,648 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-13 01:01:59,648 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-13 01:01:59,648 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 01:01:59,648 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 01:01:59,648 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 01:01:59,648 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 01:01:59,648 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-13 01:01:59,648 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 01:01:59,649 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 01:01:59,649 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 01:01:59,649 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 01:01:59,649 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 01:01:59,649 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 01:01:59,933 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-13 01:01:59,961 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 01:01:59,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 01:01:59 BoogieIcfgContainer [2018-04-13 01:01:59,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 01:01:59,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 01:01:59,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 01:01:59,965 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 01:01:59,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 01:01:59" (1/3) ... [2018-04-13 01:01:59,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f412413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 01:01:59, skipping insertion in model container [2018-04-13 01:01:59,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:59" (2/3) ... [2018-04-13 01:01:59,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f412413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 01:01:59, skipping insertion in model container [2018-04-13 01:01:59,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 01:01:59" (3/3) ... [2018-04-13 01:01:59,968 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_false-valid-deref.i [2018-04-13 01:01:59,976 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-13 01:01:59,983 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-04-13 01:02:00,015 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 01:02:00,016 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 01:02:00,016 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 01:02:00,016 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-13 01:02:00,016 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-13 01:02:00,016 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 01:02:00,017 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 01:02:00,017 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 01:02:00,017 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 01:02:00,017 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 01:02:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2018-04-13 01:02:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 01:02:00,039 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:00,039 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:02:00,039 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-13 01:02:00,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2048667359, now seen corresponding path program 1 times [2018-04-13 01:02:00,073 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:00,119 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:00,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-13 01:02:00,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:02:00,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 01:02:00,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:00,209 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-13 01:02:00,210 INFO L182 omatonBuilderFactory]: Interpolants [98#true, 99#false, 100#(and (= 5 (select |#length| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0))] [2018-04-13 01:02:00,210 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-13 01:02:00,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 01:02:00,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 01:02:00,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 01:02:00,225 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2018-04-13 01:02:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:00,288 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-13 01:02:00,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 01:02:00,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-04-13 01:02:00,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:00,297 INFO L225 Difference]: With dead ends: 89 [2018-04-13 01:02:00,297 INFO L226 Difference]: Without dead ends: 86 [2018-04-13 01:02:00,298 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 01:02:00,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-13 01:02:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-13 01:02:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-13 01:02:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-13 01:02:00,322 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 15 [2018-04-13 01:02:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:00,322 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-13 01:02:00,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 01:02:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-13 01:02:00,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 01:02:00,322 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:00,322 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:02:00,323 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-13 01:02:00,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2048667360, now seen corresponding path program 1 times [2018-04-13 01:02:00,323 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:00,334 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:00,352 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-13 01:02:00,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:02:00,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 01:02:00,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:00,353 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-13 01:02:00,353 INFO L182 omatonBuilderFactory]: Interpolants [276#true, 277#false, 278#(= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|))] [2018-04-13 01:02:00,353 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-13 01:02:00,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 01:02:00,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 01:02:00,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 01:02:00,355 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 3 states. [2018-04-13 01:02:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:00,429 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-04-13 01:02:00,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 01:02:00,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-04-13 01:02:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:00,431 INFO L225 Difference]: With dead ends: 121 [2018-04-13 01:02:00,431 INFO L226 Difference]: Without dead ends: 121 [2018-04-13 01:02:00,432 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 01:02:00,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-13 01:02:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 80. [2018-04-13 01:02:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-13 01:02:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-04-13 01:02:00,438 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 15 [2018-04-13 01:02:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:00,439 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-04-13 01:02:00,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 01:02:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-04-13 01:02:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 01:02:00,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:00,440 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-13 01:02:00,440 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-13 01:02:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1967781157, now seen corresponding path program 1 times [2018-04-13 01:02:00,441 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:00,457 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:00,493 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-13 01:02:00,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:02:00,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 01:02:00,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:00,494 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-13 01:02:00,494 INFO L182 omatonBuilderFactory]: Interpolants [480#true, 481#false, 482#(and (= 5 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 483#(and (= 5 (select |#length| main_~p~0.base)) (= main_~p~0.offset 0))] [2018-04-13 01:02:00,495 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-13 01:02:00,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:02:00,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:02:00,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:02:00,495 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 4 states. [2018-04-13 01:02:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:00,586 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-04-13 01:02:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 01:02:00,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-13 01:02:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:00,586 INFO L225 Difference]: With dead ends: 68 [2018-04-13 01:02:00,587 INFO L226 Difference]: Without dead ends: 68 [2018-04-13 01:02:00,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:02:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-13 01:02:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-13 01:02:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-13 01:02:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-04-13 01:02:00,589 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 20 [2018-04-13 01:02:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:00,590 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-04-13 01:02:00,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:02:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-04-13 01:02:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 01:02:00,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:00,590 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-13 01:02:00,590 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-13 01:02:00,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1967781159, now seen corresponding path program 1 times [2018-04-13 01:02:00,591 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:00,602 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:00,623 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-13 01:02:00,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:02:00,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 01:02:00,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:00,624 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-13 01:02:00,624 INFO L182 omatonBuilderFactory]: Interpolants [624#(= 1 (select |#valid| |main_#t~malloc0.base|)), 625#(= 1 (select |#valid| main_~p~0.base)), 622#true, 623#false] [2018-04-13 01:02:00,624 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-13 01:02:00,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:02:00,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:02:00,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:02:00,625 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 4 states. [2018-04-13 01:02:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:00,718 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2018-04-13 01:02:00,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 01:02:00,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-13 01:02:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:00,720 INFO L225 Difference]: With dead ends: 90 [2018-04-13 01:02:00,720 INFO L226 Difference]: Without dead ends: 90 [2018-04-13 01:02:00,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:02:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-13 01:02:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2018-04-13 01:02:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-13 01:02:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-04-13 01:02:00,725 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 20 [2018-04-13 01:02:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:00,725 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-04-13 01:02:00,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:02:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-04-13 01:02:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 01:02:00,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:00,726 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] [2018-04-13 01:02:00,726 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-13 01:02:00,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2114791798, now seen corresponding path program 1 times [2018-04-13 01:02:00,727 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:00,748 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:00,774 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-13 01:02:00,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:02:00,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 01:02:00,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:00,774 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-13 01:02:00,775 INFO L182 omatonBuilderFactory]: Interpolants [785#true, 786#false, 787#(or (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (not (= |#Ultimate.C_memcpy_size| 5))), 788#(not (= |#Ultimate.C_memcpy_size| 5))] [2018-04-13 01:02:00,775 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-13 01:02:00,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:02:00,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:02:00,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:02:00,775 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 4 states. [2018-04-13 01:02:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:00,784 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-04-13 01:02:00,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 01:02:00,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-13 01:02:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:00,785 INFO L225 Difference]: With dead ends: 70 [2018-04-13 01:02:00,786 INFO L226 Difference]: Without dead ends: 68 [2018-04-13 01:02:00,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:02:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-13 01:02:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-13 01:02:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-13 01:02:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-04-13 01:02:00,789 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 32 [2018-04-13 01:02:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:00,790 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-04-13 01:02:00,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:02:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-04-13 01:02:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 01:02:00,790 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:00,791 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-13 01:02:00,791 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-13 01:02:00,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1008408557, now seen corresponding path program 1 times [2018-04-13 01:02:00,791 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:00,805 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:00,841 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-13 01:02:00,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:02:00,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-13 01:02:00,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:00,842 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-13 01:02:00,842 INFO L182 omatonBuilderFactory]: Interpolants [928#false, 929#(or (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (not (= |#Ultimate.C_memcpy_size| 5))), 930#(or (not (= |#Ultimate.C_memcpy_size| 5)) (<= |#Ultimate.C_memcpy_#t~loopctr8| 1)), 931#(not (= |#Ultimate.C_memcpy_size| 5)), 927#true] [2018-04-13 01:02:00,842 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-13 01:02:00,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:02:00,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:02:00,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:02:00,843 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 5 states. [2018-04-13 01:02:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:00,851 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-13 01:02:00,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 01:02:00,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-04-13 01:02:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:00,852 INFO L225 Difference]: With dead ends: 71 [2018-04-13 01:02:00,852 INFO L226 Difference]: Without dead ends: 69 [2018-04-13 01:02:00,852 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:02:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-13 01:02:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-04-13 01:02:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-13 01:02:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-04-13 01:02:00,855 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 33 [2018-04-13 01:02:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:00,856 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-04-13 01:02:00,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:02:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-04-13 01:02:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 01:02:00,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:00,857 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-13 01:02:00,857 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-13 01:02:00,857 INFO L82 PathProgramCache]: Analyzing trace with hash -956628246, now seen corresponding path program 2 times [2018-04-13 01:02:00,858 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:00,873 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:00,907 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-13 01:02:00,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:02:00,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-13 01:02:00,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:00,908 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-13 01:02:00,908 INFO L182 omatonBuilderFactory]: Interpolants [1072#true, 1073#false, 1074#(or (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (not (= |#Ultimate.C_memcpy_size| 5))), 1075#(or (not (= |#Ultimate.C_memcpy_size| 5)) (<= |#Ultimate.C_memcpy_#t~loopctr8| 1)), 1076#(or (<= |#Ultimate.C_memcpy_#t~loopctr8| 2) (not (= |#Ultimate.C_memcpy_size| 5))), 1077#(not (= |#Ultimate.C_memcpy_size| 5))] [2018-04-13 01:02:00,908 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-13 01:02:00,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 01:02:00,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 01:02:00,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-13 01:02:00,909 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 6 states. [2018-04-13 01:02:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:00,932 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-04-13 01:02:00,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 01:02:00,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-13 01:02:00,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:00,937 INFO L225 Difference]: With dead ends: 72 [2018-04-13 01:02:00,938 INFO L226 Difference]: Without dead ends: 70 [2018-04-13 01:02:00,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-13 01:02:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-13 01:02:00,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-04-13 01:02:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-13 01:02:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-04-13 01:02:00,942 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 34 [2018-04-13 01:02:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:00,942 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-04-13 01:02:00,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 01:02:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-04-13 01:02:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 01:02:00,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:00,952 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-13 01:02:00,953 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-13 01:02:00,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1743226995, now seen corresponding path program 3 times [2018-04-13 01:02:00,953 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:00,970 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:01,019 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-13 01:02:01,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:02:01,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-13 01:02:01,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:01,020 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-13 01:02:01,020 INFO L182 omatonBuilderFactory]: Interpolants [1220#true, 1221#false, 1222#(or (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (not (= |#Ultimate.C_memcpy_size| 5))), 1223#(or (not (= |#Ultimate.C_memcpy_size| 5)) (<= |#Ultimate.C_memcpy_#t~loopctr8| 1)), 1224#(or (<= |#Ultimate.C_memcpy_#t~loopctr8| 2) (not (= |#Ultimate.C_memcpy_size| 5))), 1225#(or (<= |#Ultimate.C_memcpy_#t~loopctr8| 3) (not (= |#Ultimate.C_memcpy_size| 5))), 1226#(not (= |#Ultimate.C_memcpy_size| 5))] [2018-04-13 01:02:01,021 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-13 01:02:01,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 01:02:01,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 01:02:01,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-13 01:02:01,021 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 7 states. [2018-04-13 01:02:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:01,037 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-04-13 01:02:01,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 01:02:01,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-04-13 01:02:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:01,039 INFO L225 Difference]: With dead ends: 73 [2018-04-13 01:02:01,039 INFO L226 Difference]: Without dead ends: 71 [2018-04-13 01:02:01,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-13 01:02:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-13 01:02:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-04-13 01:02:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-13 01:02:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-04-13 01:02:01,042 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 35 [2018-04-13 01:02:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:01,043 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-04-13 01:02:01,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 01:02:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-04-13 01:02:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 01:02:01,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:01,044 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-13 01:02:01,044 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-13 01:02:01,044 INFO L82 PathProgramCache]: Analyzing trace with hash -357984438, now seen corresponding path program 4 times [2018-04-13 01:02:01,045 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:01,059 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:01,128 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-13 01:02:01,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:02:01,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 01:02:01,129 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:01,129 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-13 01:02:01,129 INFO L182 omatonBuilderFactory]: Interpolants [1376#(or (<= |#Ultimate.C_memcpy_#t~loopctr8| 3) (not (= |#Ultimate.C_memcpy_size| 5))), 1377#(or (<= |#Ultimate.C_memcpy_#t~loopctr8| 4) (not (= |#Ultimate.C_memcpy_size| 5))), 1378#(not (= |#Ultimate.C_memcpy_size| 5)), 1371#true, 1372#false, 1373#(or (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (not (= |#Ultimate.C_memcpy_size| 5))), 1374#(or (not (= |#Ultimate.C_memcpy_size| 5)) (<= |#Ultimate.C_memcpy_#t~loopctr8| 1)), 1375#(or (<= |#Ultimate.C_memcpy_#t~loopctr8| 2) (not (= |#Ultimate.C_memcpy_size| 5)))] [2018-04-13 01:02:01,129 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-13 01:02:01,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 01:02:01,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 01:02:01,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-13 01:02:01,130 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 8 states. [2018-04-13 01:02:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:01,147 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-04-13 01:02:01,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 01:02:01,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-04-13 01:02:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:01,149 INFO L225 Difference]: With dead ends: 74 [2018-04-13 01:02:01,149 INFO L226 Difference]: Without dead ends: 72 [2018-04-13 01:02:01,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-13 01:02:01,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-13 01:02:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-04-13 01:02:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-13 01:02:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-04-13 01:02:01,152 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 36 [2018-04-13 01:02:01,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:01,153 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-04-13 01:02:01,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 01:02:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-04-13 01:02:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 01:02:01,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:01,154 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-13 01:02:01,154 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-13 01:02:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash -365138131, now seen corresponding path program 5 times [2018-04-13 01:02:01,157 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:01,202 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:02:01,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:02:01,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 01:02:01,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:01,761 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-13 01:02:01,761 INFO L182 omatonBuilderFactory]: Interpolants [1536#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr8|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0))) (<= 4 (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|)) (not (= |#Ultimate.C_memcpy_size| 5))), 1537#(or (and (<= 4 |#Ultimate.C_memcpy_#t~loopctr8|) (or (<= 5 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr8|)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (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 (= |#Ultimate.C_memcpy_size| 5))), 1538#(or (<= 6 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|)) (<= (+ |#Ultimate.C_memcpy_dest.offset| 1) 0) (<= (+ |#Ultimate.C_memcpy_src.offset| 1) 0) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (<= 6 (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset|))), 1539#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 1540#(= |main_#t~mem2| 1), 1541#(= 1 (select |#valid| main_~p~0.base)), 1525#true, 1526#false, 1527#(= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0), 1528#(and (= |main_#t~malloc0.offset| 0) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 1529#(and (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 1530#(and (= 1 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 1531#(= |#memory_int| |old(#memory_int)|), 1532#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|) (not (= |#Ultimate.C_memcpy_size| 5))), 1533#(or (and (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#memory_int| |old(#memory_int)|))) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5))), 1534#(or (<= 2 (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 1 |#Ultimate.C_memcpy_#t~loopctr8|))), 1535#(or (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr8|) (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 3 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr8|)))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)))] [2018-04-13 01:02:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:02:01,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 01:02:01,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 01:02:01,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-04-13 01:02:01,761 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 17 states. [2018-04-13 01:02:02,053 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 41 DAG size of output 37 [2018-04-13 01:02:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:02,366 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-04-13 01:02:02,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 01:02:02,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-04-13 01:02:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:02,367 INFO L225 Difference]: With dead ends: 68 [2018-04-13 01:02:02,367 INFO L226 Difference]: Without dead ends: 68 [2018-04-13 01:02:02,367 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2018-04-13 01:02:02,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-13 01:02:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-04-13 01:02:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-13 01:02:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-04-13 01:02:02,369 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 37 [2018-04-13 01:02:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:02,369 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-04-13 01:02:02,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 01:02:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-04-13 01:02:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 01:02:02,370 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:02,370 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, 1, 1] [2018-04-13 01:02:02,371 INFO L408 AbstractCegarLoop]: === Iteration 11 === [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-13 01:02:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash -877857895, now seen corresponding path program 1 times [2018-04-13 01:02:02,371 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:02,400 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:02,784 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-13 01:02:02,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:02:02,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 01:02:02,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:02,784 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-13 01:02:02,785 INFO L182 omatonBuilderFactory]: Interpolants [1701#true, 1702#false, 1703#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 1704#(and (= 0 |main_#t~malloc0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| |main_#t~malloc0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 1705#(and (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 1706#(and (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| main_~p~0.base)) (= 2 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 1))) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 1707#(= |#memory_int| |old(#memory_int)|), 1708#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1709#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr8|) 1)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1710#(or (<= 3 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr8|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))) (<= (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|) 1) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1711#(or (<= (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|) 2) (<= (+ |#Ultimate.C_memcpy_src.offset| 1) |#Ultimate.C_memcpy_dest.offset|) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))) (<= 4 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr8|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1712#(or (<= (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|) 3) (<= 5 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr8|)) (<= (+ |#Ultimate.C_memcpy_src.offset| 1) |#Ultimate.C_memcpy_dest.offset|) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1713#(or (<= 6 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|)) (<= (+ |#Ultimate.C_memcpy_src.offset| 1) |#Ultimate.C_memcpy_dest.offset|) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (<= (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|) 4) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))), 1714#(or (<= 6 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|)) (<= (+ |#Ultimate.C_memcpy_src.offset| 1) |#Ultimate.C_memcpy_dest.offset|) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))), 1715#(and (= 2 (select (select |#memory_int| main_~p~0.base) 1)) (= 0 main_~p~0.offset)), 1716#(and (= |main_#t~mem3| 2) (= 0 main_~p~0.offset)), 1717#(= 1 (select |#valid| main_~p~0.base))] [2018-04-13 01:02:02,785 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-13 01:02:02,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 01:02:02,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 01:02:02,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-04-13 01:02:02,785 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-04-13 01:02:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:03,513 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-04-13 01:02:03,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 01:02:03,513 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-04-13 01:02:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:03,514 INFO L225 Difference]: With dead ends: 104 [2018-04-13 01:02:03,514 INFO L226 Difference]: Without dead ends: 104 [2018-04-13 01:02:03,515 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 01:02:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-13 01:02:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2018-04-13 01:02:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-13 01:02:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-04-13 01:02:03,519 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 39 [2018-04-13 01:02:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:03,519 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-04-13 01:02:03,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 01:02:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-04-13 01:02:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 01:02:03,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:03,520 INFO L355 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:02:03,520 INFO L408 AbstractCegarLoop]: === Iteration 12 === [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-13 01:02:03,520 INFO L82 PathProgramCache]: Analyzing trace with hash 754838742, now seen corresponding path program 2 times [2018-04-13 01:02:03,521 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:03,534 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:02:03,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:02:03,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 01:02:03,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:03,698 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-13 01:02:03,698 INFO L182 omatonBuilderFactory]: Interpolants [1936#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 5)) (and (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset|) (select |#length| |#Ultimate.C_memcpy_dest.base|)))), 1937#(or (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset| 1) (+ (select |#length| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_#t~loopctr8|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 5))), 1938#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 5)) (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset| 2) (+ (select |#length| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_#t~loopctr8|))), 1939#(or (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset| 3) (+ (select |#length| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_#t~loopctr8|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 5))), 1940#(or (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset| 4) (+ (select |#length| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_#t~loopctr8|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 5))), 1941#(or (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset| 5) (+ (select |#length| |#Ultimate.C_memcpy_dest.base|) |#Ultimate.C_memcpy_#t~loopctr8|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 5))), 1942#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 5))), 1931#true, 1932#false, 1933#(and (= 5 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 1934#(and (= 5 (select |#length| main_~p~0.base)) (= 0 main_~p~0.offset)), 1935#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= (select |#length| |#Ultimate.C_memcpy_dest.base|) 5)) (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset|) (select |#length| |#Ultimate.C_memcpy_dest.base|)))] [2018-04-13 01:02:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:02:03,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 01:02:03,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 01:02:03,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-04-13 01:02:03,699 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 12 states. [2018-04-13 01:02:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:03,910 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-04-13 01:02:03,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 01:02:03,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-04-13 01:02:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:03,912 INFO L225 Difference]: With dead ends: 65 [2018-04-13 01:02:03,912 INFO L226 Difference]: Without dead ends: 62 [2018-04-13 01:02:03,912 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-04-13 01:02:03,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-13 01:02:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-04-13 01:02:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-13 01:02:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-04-13 01:02:03,914 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 40 [2018-04-13 01:02:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:03,915 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-04-13 01:02:03,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 01:02:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-04-13 01:02:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 01:02:03,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:03,916 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, 1, 1, 1, 1] [2018-04-13 01:02:03,916 INFO L408 AbstractCegarLoop]: === Iteration 13 === [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-13 01:02:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash 319688389, now seen corresponding path program 1 times [2018-04-13 01:02:03,917 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:03,937 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:02:04,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:02:04,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 01:02:04,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:04,352 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-13 01:02:04,352 INFO L182 omatonBuilderFactory]: Interpolants [2082#true, 2083#false, 2084#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 2085#(and (= 0 |main_#t~malloc0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| |main_#t~malloc0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 2086#(and (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 2087#(and (not (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 2))) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 2088#(= |#memory_int| |old(#memory_int)|), 2089#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2090#(or (and (= |#Ultimate.C_memcpy_#t~loopctr8| 0) (or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2091#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr8|) (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2092#(or (and (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))) (<= 2 |#Ultimate.C_memcpy_#t~loopctr8|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2093#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr8|) (or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (- 2)))) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (- 2))))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (- 2)))) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (- 2)))))) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 4 (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2094#(or (and (<= 4 |#Ultimate.C_memcpy_#t~loopctr8|) (or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (- 2)))) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (- 2))))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (- 2)))) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (- 2)))))) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 5 (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|)))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2095#(or (<= 6 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|)) (<= (+ |#Ultimate.C_memcpy_src.offset| 1) 0) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (- 2)))) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (- 2)))))), 2096#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 2)))), 2097#(and (= |main_#t~mem4| 3) (= 0 main_~p~0.offset)), 2098#(= 1 (select |#valid| main_~p~0.base))] [2018-04-13 01:02:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:02:04,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 01:02:04,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 01:02:04,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-04-13 01:02:04,353 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 17 states. [2018-04-13 01:02:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:04,778 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-04-13 01:02:04,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 01:02:04,778 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-04-13 01:02:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:04,778 INFO L225 Difference]: With dead ends: 58 [2018-04-13 01:02:04,778 INFO L226 Difference]: Without dead ends: 58 [2018-04-13 01:02:04,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2018-04-13 01:02:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-13 01:02:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-04-13 01:02:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 01:02:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-04-13 01:02:04,781 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 41 [2018-04-13 01:02:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:04,781 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-04-13 01:02:04,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 01:02:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-04-13 01:02:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 01:02:04,782 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:04,782 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, 1, 1, 1, 1, 1, 1] [2018-04-13 01:02:04,782 INFO L408 AbstractCegarLoop]: === Iteration 14 === [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-13 01:02:04,783 INFO L82 PathProgramCache]: Analyzing trace with hash 110432433, now seen corresponding path program 1 times [2018-04-13 01:02:04,783 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:04,808 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 01:02:05,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:02:05,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 01:02:05,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:05,112 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-13 01:02:05,113 INFO L182 omatonBuilderFactory]: Interpolants [2242#true, 2243#false, 2244#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 2245#(and (= 0 |main_#t~malloc0.offset|) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0) (not (= |main_#t~malloc0.base| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|))), 2246#(and (not (= main_~p~0.base |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 2247#(and (not (= main_~p~0.base |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= 4 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 3))) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 2248#(= |#memory_int| |old(#memory_int)|), 2249#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2250#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2251#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr8|) 3)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2252#(or (<= (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|) 3) (<= 5 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr8|)) (<= (+ |#Ultimate.C_memcpy_src.offset| 1) |#Ultimate.C_memcpy_dest.offset|) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3))) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2253#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (<= (+ |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_dest.offset|) 4) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2254#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2255#(and (= 4 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 3))) (= 0 main_~p~0.offset)), 2256#(and (= |main_#t~mem5| 4) (= 0 main_~p~0.offset)), 2257#(= 1 (select |#valid| main_~p~0.base))] [2018-04-13 01:02:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 01:02:05,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 01:02:05,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 01:02:05,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-04-13 01:02:05,114 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 16 states. [2018-04-13 01:02:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:05,486 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-04-13 01:02:05,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 01:02:05,487 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-13 01:02:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:05,487 INFO L225 Difference]: With dead ends: 53 [2018-04-13 01:02:05,487 INFO L226 Difference]: Without dead ends: 53 [2018-04-13 01:02:05,488 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-04-13 01:02:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-13 01:02:05,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-04-13 01:02:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 01:02:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-04-13 01:02:05,489 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2018-04-13 01:02:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:05,489 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-04-13 01:02:05,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 01:02:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-04-13 01:02:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 01:02:05,490 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:05,490 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:02:05,490 INFO L408 AbstractCegarLoop]: === Iteration 15 === [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-13 01:02:05,490 INFO L82 PathProgramCache]: Analyzing trace with hash 885632993, now seen corresponding path program 1 times [2018-04-13 01:02:05,490 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:05,498 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-13 01:02:05,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:02:05,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 01:02:05,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:05,540 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-13 01:02:05,540 INFO L182 omatonBuilderFactory]: Interpolants [2385#true, 2386#false, 2387#(= |#valid| |old(#valid)|), 2388#(= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|), 2389#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)] [2018-04-13 01:02:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-13 01:02:05,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:02:05,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:02:05,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:02:05,540 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 5 states. [2018-04-13 01:02:05,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:05,583 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-04-13 01:02:05,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 01:02:05,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-04-13 01:02:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:05,584 INFO L225 Difference]: With dead ends: 52 [2018-04-13 01:02:05,584 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 01:02:05,584 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 01:02:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 01:02:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-13 01:02:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 01:02:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2018-04-13 01:02:05,586 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 45 [2018-04-13 01:02:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:05,586 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2018-04-13 01:02:05,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:02:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2018-04-13 01:02:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 01:02:05,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:02:05,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:02:05,587 INFO L408 AbstractCegarLoop]: === Iteration 16 === [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-13 01:02:05,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1476780718, now seen corresponding path program 1 times [2018-04-13 01:02:05,588 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:02:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:02:05,606 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:02:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-13 01:02:05,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:02:05,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 01:02:05,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:02:05,807 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-13 01:02:05,808 INFO L182 omatonBuilderFactory]: Interpolants [2496#(and (= 0 |main_#t~malloc0.offset|) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0) (not (= |main_#t~malloc0.base| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|))), 2497#(and (not (= main_~p~0.base |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 2498#(and (= 5 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 4))) (not (= main_~p~0.base |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0)), 2499#(= |#memory_int| |old(#memory_int)|), 2500#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|) (not (= |#Ultimate.C_memcpy_size| 5))), 2501#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2502#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (<= (+ |#Ultimate.C_memcpy_#t~loopctr8| 1) |#Ultimate.C_memcpy_size|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ |#Ultimate.C_memcpy_dest.offset| (- (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr8|) 1)))))))) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr8|) 1))))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (<= |#Ultimate.C_memcpy_#t~loopctr8| |#Ultimate.C_memcpy_size|)) (not (= |#Ultimate.C_memcpy_size| 5))), 2503#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ |#Ultimate.C_memcpy_dest.offset| (- (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_size|) 1)))))))) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_size|) 1))))) (not (= |#Ultimate.C_memcpy_size| 5)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2504#(and (= 5 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset)), 2505#(and (= |main_#t~mem6| 5) (= 0 main_~p~0.offset)), 2506#(= 1 (select |#valid| main_~p~0.base)), 2493#true, 2494#false, 2495#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 0))] [2018-04-13 01:02:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-13 01:02:05,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 01:02:05,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 01:02:05,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-04-13 01:02:05,808 INFO L87 Difference]: Start difference. First operand 47 states and 46 transitions. Second operand 14 states. [2018-04-13 01:02:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:02:06,101 INFO L93 Difference]: Finished difference Result 41 states and 40 transitions. [2018-04-13 01:02:06,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 01:02:06,102 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2018-04-13 01:02:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:02:06,102 INFO L225 Difference]: With dead ends: 41 [2018-04-13 01:02:06,102 INFO L226 Difference]: Without dead ends: 0 [2018-04-13 01:02:06,103 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2018-04-13 01:02:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-13 01:02:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-13 01:02:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-13 01:02:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-13 01:02:06,103 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-04-13 01:02:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:02:06,103 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-13 01:02:06,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 01:02:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-13 01:02:06,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-13 01:02:06,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 01:02:06 BoogieIcfgContainer [2018-04-13 01:02:06,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 01:02:06,108 INFO L168 Benchmark]: Toolchain (without parser) took 6685.87 ms. Allocated memory was 405.3 MB in the beginning and 761.8 MB in the end (delta: 356.5 MB). Free memory was 347.5 MB in the beginning and 657.1 MB in the end (delta: -309.6 MB). Peak memory consumption was 46.9 MB. Max. memory is 5.3 GB. [2018-04-13 01:02:06,109 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 405.3 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 01:02:06,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.24 ms. Allocated memory is still 405.3 MB. Free memory was 347.5 MB in the beginning and 337.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-13 01:02:06,110 INFO L168 Benchmark]: Boogie Preprocessor took 29.73 ms. Allocated memory is still 405.3 MB. Free memory was 337.0 MB in the beginning and 335.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 01:02:06,110 INFO L168 Benchmark]: RCFGBuilder took 349.87 ms. Allocated memory was 405.3 MB in the beginning and 615.0 MB in the end (delta: 209.7 MB). Free memory was 335.6 MB in the beginning and 568.7 MB in the end (delta: -233.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 5.3 GB. [2018-04-13 01:02:06,110 INFO L168 Benchmark]: TraceAbstraction took 6145.25 ms. Allocated memory was 615.0 MB in the beginning and 761.8 MB in the end (delta: 146.8 MB). Free memory was 568.7 MB in the beginning and 657.1 MB in the end (delta: -88.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 5.3 GB. [2018-04-13 01:02:06,112 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.12 ms. Allocated memory is still 405.3 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.24 ms. Allocated memory is still 405.3 MB. Free memory was 347.5 MB in the beginning and 337.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.73 ms. Allocated memory is still 405.3 MB. Free memory was 337.0 MB in the beginning and 335.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 349.87 ms. Allocated memory was 405.3 MB in the beginning and 615.0 MB in the end (delta: 209.7 MB). Free memory was 335.6 MB in the beginning and 568.7 MB in the end (delta: -233.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6145.25 ms. Allocated memory was 615.0 MB in the beginning and 761.8 MB in the end (delta: 146.8 MB). Free memory was 568.7 MB in the beginning and 657.1 MB in the end (delta: -88.4 MB). Peak memory consumption was 58.4 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, 6.0s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 640 SDtfs, 1273 SDslu, 1491 SDs, 0 SdLazy, 2346 SolverSat, 326 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 46/131 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, 16 MinimizatonAttempts, 96 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 531 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 515 ConstructedInterpolants, 0 QuantifiedInterpolants, 144953 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 46/131 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_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_01-02-06-120.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_01-02-06-120.csv Received shutdown request...