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.1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 14:24:18,055 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 14:24:18,057 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 14:24:18,070 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 14:24:18,070 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 14:24:18,071 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 14:24:18,072 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 14:24:18,073 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 14:24:18,075 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 14:24:18,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 14:24:18,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 14:24:18,077 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 14:24:18,077 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 14:24:18,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 14:24:18,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 14:24:18,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 14:24:18,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 14:24:18,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 14:24:18,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 14:24:18,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 14:24:18,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 14:24:18,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 14:24:18,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 14:24:18,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 14:24:18,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 14:24:18,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 14:24:18,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 14:24:18,094 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 14:24:18,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 14:24:18,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 14:24:18,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 14:24:18,095 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-11 14:24:18,120 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 14:24:18,121 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 14:24:18,122 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 14:24:18,122 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 14:24:18,122 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 14:24:18,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 14:24:18,122 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 14:24:18,123 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 14:24:18,123 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 14:24:18,123 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 14:24:18,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 14:24:18,123 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 14:24:18,123 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 14:24:18,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 14:24:18,123 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 14:24:18,123 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 14:24:18,124 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 14:24:18,124 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 14:24:18,124 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 14:24:18,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 14:24:18,124 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 14:24:18,124 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-11 14:24:18,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 14:24:18,160 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 14:24:18,163 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 14:24:18,164 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 14:24:18,164 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 14:24:18,165 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.1_false-valid-free.i [2018-04-11 14:24:18,466 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc2c96d119 [2018-04-11 14:24:18,572 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 14:24:18,572 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 14:24:18,573 INFO L168 CDTParser]: Scanning test-bitfields-2.1_false-valid-free.i [2018-04-11 14:24:18,574 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 14:24:18,574 INFO L215 ultiparseSymbolTable]: [2018-04-11 14:24:18,574 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 14:24:18,574 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2.1_false-valid-free.i [2018-04-11 14:24:18,574 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 14:24:18,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____false_valid_free_i__d in test-bitfields-2.1_false-valid-free.i [2018-04-11 14:24:18,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____false_valid_free_i__size_t in test-bitfields-2.1_false-valid-free.i [2018-04-11 14:24:18,593 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc2c96d119 [2018-04-11 14:24:18,596 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 14:24:18,597 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 14:24:18,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 14:24:18,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 14:24:18,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 14:24:18,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:24:18" (1/1) ... [2018-04-11 14:24:18,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b06b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:18, skipping insertion in model container [2018-04-11 14:24:18,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:24:18" (1/1) ... [2018-04-11 14:24:18,617 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:24:18,626 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:24:18,732 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:24:18,754 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:24:18,761 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 14:24:18,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:18 WrapperNode [2018-04-11 14:24:18,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 14:24:18,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 14:24:18,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 14:24:18,771 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 14:24:18,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:18" (1/1) ... [2018-04-11 14:24:18,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:18" (1/1) ... [2018-04-11 14:24:18,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:18" (1/1) ... [2018-04-11 14:24:18,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:18" (1/1) ... [2018-04-11 14:24:18,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:18" (1/1) ... [2018-04-11 14:24:18,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:18" (1/1) ... [2018-04-11 14:24:18,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:18" (1/1) ... [2018-04-11 14:24:18,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 14:24:18,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 14:24:18,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 14:24:18,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 14:24:18,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:18" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 14:24:18,841 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 14:24:18,841 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 14:24:18,841 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 14:24:18,841 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 14:24:18,841 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 14:24:18,841 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 14:24:18,841 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 14:24:18,841 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 14:24:18,841 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 14:24:18,841 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 14:24:18,842 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 14:24:18,842 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 14:24:18,842 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 14:24:18,842 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 14:24:18,842 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 14:24:18,842 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 14:24:19,121 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 14:24:19,139 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 14:24:19,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:24:19 BoogieIcfgContainer [2018-04-11 14:24:19,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 14:24:19,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 14:24:19,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 14:24:19,142 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 14:24:19,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 02:24:18" (1/3) ... [2018-04-11 14:24:19,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ae585e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:24:19, skipping insertion in model container [2018-04-11 14:24:19,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:24:18" (2/3) ... [2018-04-11 14:24:19,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ae585e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:24:19, skipping insertion in model container [2018-04-11 14:24:19,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:24:19" (3/3) ... [2018-04-11 14:24:19,144 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2.1_false-valid-free.i [2018-04-11 14:24:19,152 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 14:24:19,160 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-04-11 14:24:19,193 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 14:24:19,194 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 14:24:19,194 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 14:24:19,194 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 14:24:19,194 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 14:24:19,194 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 14:24:19,194 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 14:24:19,194 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 14:24:19,194 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 14:24:19,195 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 14:24:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-04-11 14:24:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 14:24:19,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:19,214 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:19,214 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash -860719877, now seen corresponding path program 1 times [2018-04-11 14:24:19,248 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:19,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:19,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 14:24:19,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,399 INFO L182 omatonBuilderFactory]: Interpolants [96#(= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)), 94#true, 95#false] [2018-04-11 14:24:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 14:24:19,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 14:24:19,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 14:24:19,410 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 3 states. [2018-04-11 14:24:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:19,528 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-04-11 14:24:19,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 14:24:19,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-04-11 14:24:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:19,541 INFO L225 Difference]: With dead ends: 117 [2018-04-11 14:24:19,541 INFO L226 Difference]: Without dead ends: 114 [2018-04-11 14:24:19,543 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-11 14:24:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-11 14:24:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 82. [2018-04-11 14:24:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 14:24:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-04-11 14:24:19,572 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 20 [2018-04-11 14:24:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:19,572 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-04-11 14:24:19,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 14:24:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-04-11 14:24:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 14:24:19,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:19,573 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:19,573 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:19,573 INFO L82 PathProgramCache]: Analyzing trace with hash -860719876, now seen corresponding path program 1 times [2018-04-11 14:24:19,574 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:19,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:19,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:24:19,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,659 INFO L182 omatonBuilderFactory]: Interpolants [296#true, 297#false, 298#(and (= (select |#valid| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|) 1) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0) (= 13 (select |#length| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|))), 299#(and (not (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |main_#t~malloc0.base|)) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0) (= 13 (select |#length| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|))), 300#(and (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0) (= 13 (select |#length| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)))] [2018-04-11 14:24:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:24:19,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:24:19,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:24:19,660 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 5 states. [2018-04-11 14:24:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:19,810 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2018-04-11 14:24:19,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:24:19,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-04-11 14:24:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:19,812 INFO L225 Difference]: With dead ends: 108 [2018-04-11 14:24:19,812 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 14:24:19,812 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:24:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 14:24:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 76. [2018-04-11 14:24:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 14:24:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-04-11 14:24:19,818 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 20 [2018-04-11 14:24:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:19,819 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-04-11 14:24:19,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:24:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-04-11 14:24:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 14:24:19,819 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:19,820 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] [2018-04-11 14:24:19,820 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:19,820 INFO L82 PathProgramCache]: Analyzing trace with hash -258775389, now seen corresponding path program 1 times [2018-04-11 14:24:19,821 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:19,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:19,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:24:19,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,865 INFO L182 omatonBuilderFactory]: Interpolants [487#true, 488#false, 489#(= 1 (select |#valid| |main_#t~malloc0.base|)), 490#(= 1 (select |#valid| main_~p~0.base))] [2018-04-11 14:24:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:19,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:24:19,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:24:19,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:24:19,866 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 4 states. [2018-04-11 14:24:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:19,941 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-04-11 14:24:19,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:24:19,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-11 14:24:19,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:19,942 INFO L225 Difference]: With dead ends: 103 [2018-04-11 14:24:19,942 INFO L226 Difference]: Without dead ends: 103 [2018-04-11 14:24:19,943 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-11 14:24:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-11 14:24:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2018-04-11 14:24:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 14:24:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-04-11 14:24:19,946 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 25 [2018-04-11 14:24:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:19,946 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-04-11 14:24:19,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:24:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-04-11 14:24:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 14:24:19,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:19,947 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] [2018-04-11 14:24:19,947 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:19,947 INFO L82 PathProgramCache]: Analyzing trace with hash -258775387, now seen corresponding path program 1 times [2018-04-11 14:24:19,947 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:19,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:20,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:24:20,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,002 INFO L182 omatonBuilderFactory]: Interpolants [672#false, 673#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 674#(and (= 12 (select |#length| main_~p~0.base)) (= main_~p~0.offset 0)), 671#true] [2018-04-11 14:24:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:24:20,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:24:20,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:24:20,003 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 4 states. [2018-04-11 14:24:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:20,087 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-04-11 14:24:20,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:24:20,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-11 14:24:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:20,089 INFO L225 Difference]: With dead ends: 65 [2018-04-11 14:24:20,089 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 14:24:20,089 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-11 14:24:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 14:24:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-11 14:24:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-11 14:24:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-04-11 14:24:20,093 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 25 [2018-04-11 14:24:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:20,094 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-04-11 14:24:20,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:24:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-04-11 14:24:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 14:24:20,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:20,095 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, 1, 1, 1, 1] [2018-04-11 14:24:20,095 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:20,095 INFO L82 PathProgramCache]: Analyzing trace with hash -604496812, now seen corresponding path program 1 times [2018-04-11 14:24:20,096 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:20,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:20,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:24:20,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,148 INFO L182 omatonBuilderFactory]: Interpolants [807#true, 808#false, 809#(or (= |#Ultimate.C_memcpy_#t~loopctr7| 0) (not (= |#Ultimate.C_memcpy_size| 4))), 810#(not (= |#Ultimate.C_memcpy_size| 4))] [2018-04-11 14:24:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:24:20,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:24:20,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:24:20,148 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2018-04-11 14:24:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:20,154 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-04-11 14:24:20,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:24:20,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-04-11 14:24:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:20,155 INFO L225 Difference]: With dead ends: 68 [2018-04-11 14:24:20,155 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 14:24:20,155 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-11 14:24:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 14:24:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-04-11 14:24:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 14:24:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-04-11 14:24:20,157 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 37 [2018-04-11 14:24:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:20,158 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-04-11 14:24:20,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:24:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-04-11 14:24:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 14:24:20,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:20,158 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, 1, 1, 1, 1, 1] [2018-04-11 14:24:20,158 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1953371958, now seen corresponding path program 1 times [2018-04-11 14:24:20,159 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:20,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:20,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-11 14:24:20,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,229 INFO L182 omatonBuilderFactory]: Interpolants [945#true, 946#false, 947#(or (= |#Ultimate.C_memcpy_#t~loopctr7| 0) (not (= |#Ultimate.C_memcpy_size| 4))), 948#(or (<= |#Ultimate.C_memcpy_#t~loopctr7| 1) (not (= |#Ultimate.C_memcpy_size| 4))), 949#(not (= |#Ultimate.C_memcpy_size| 4))] [2018-04-11 14:24:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:24:20,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:24:20,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:24:20,230 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2018-04-11 14:24:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:20,242 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-04-11 14:24:20,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:24:20,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-11 14:24:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:20,243 INFO L225 Difference]: With dead ends: 69 [2018-04-11 14:24:20,243 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 14:24:20,243 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-11 14:24:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 14:24:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-04-11 14:24:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 14:24:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-04-11 14:24:20,247 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 38 [2018-04-11 14:24:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:20,248 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-04-11 14:24:20,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:24:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-04-11 14:24:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 14:24:20,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:20,249 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, 1, 1, 1, 1, 1] [2018-04-11 14:24:20,249 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash -357074796, now seen corresponding path program 2 times [2018-04-11 14:24:20,250 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:20,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:20,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 14:24:20,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,324 INFO L182 omatonBuilderFactory]: Interpolants [1088#(or (= |#Ultimate.C_memcpy_#t~loopctr7| 0) (not (= |#Ultimate.C_memcpy_size| 4))), 1089#(or (<= |#Ultimate.C_memcpy_#t~loopctr7| 1) (not (= |#Ultimate.C_memcpy_size| 4))), 1090#(or (<= |#Ultimate.C_memcpy_#t~loopctr7| 2) (not (= |#Ultimate.C_memcpy_size| 4))), 1091#(not (= |#Ultimate.C_memcpy_size| 4)), 1086#true, 1087#false] [2018-04-11 14:24:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:24:20,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:24:20,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:24:20,325 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-04-11 14:24:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:20,337 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-04-11 14:24:20,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:24:20,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-04-11 14:24:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:20,339 INFO L225 Difference]: With dead ends: 70 [2018-04-11 14:24:20,340 INFO L226 Difference]: Without dead ends: 68 [2018-04-11 14:24:20,340 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-11 14:24:20,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-11 14:24:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-11 14:24:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-11 14:24:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-11 14:24:20,344 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 39 [2018-04-11 14:24:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:20,345 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-11 14:24:20,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:24:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-11 14:24:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 14:24:20,345 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:20,346 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, 1, 1, 1, 1, 1] [2018-04-11 14:24:20,346 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1033519862, now seen corresponding path program 3 times [2018-04-11 14:24:20,347 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:20,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:20,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 14:24:20,425 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,425 INFO L182 omatonBuilderFactory]: Interpolants [1232#(or (= |#Ultimate.C_memcpy_#t~loopctr7| 0) (not (= |#Ultimate.C_memcpy_size| 4))), 1233#(or (<= |#Ultimate.C_memcpy_#t~loopctr7| 1) (not (= |#Ultimate.C_memcpy_size| 4))), 1234#(or (<= |#Ultimate.C_memcpy_#t~loopctr7| 2) (not (= |#Ultimate.C_memcpy_size| 4))), 1235#(or (not (= |#Ultimate.C_memcpy_size| 4)) (<= |#Ultimate.C_memcpy_#t~loopctr7| 3)), 1236#(not (= |#Ultimate.C_memcpy_size| 4)), 1230#true, 1231#false] [2018-04-11 14:24:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:20,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 14:24:20,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 14:24:20,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:24:20,426 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2018-04-11 14:24:20,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:20,448 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-04-11 14:24:20,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 14:24:20,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-04-11 14:24:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:20,449 INFO L225 Difference]: With dead ends: 71 [2018-04-11 14:24:20,449 INFO L226 Difference]: Without dead ends: 69 [2018-04-11 14:24:20,449 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-11 14:24:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-11 14:24:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-04-11 14:24:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 14:24:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-04-11 14:24:20,455 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 40 [2018-04-11 14:24:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:20,455 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-04-11 14:24:20,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 14:24:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-04-11 14:24:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 14:24:20,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:20,458 INFO L355 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:20,458 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:20,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1192281300, now seen corresponding path program 4 times [2018-04-11 14:24:20,459 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:20,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:21,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:21,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 14:24:21,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:21,015 INFO L182 omatonBuilderFactory]: Interpolants [1377#true, 1378#false, 1379#(= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0), 1380#(and (= |main_#t~malloc0.offset| 0) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 1381#(and (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 1382#(and (= 1 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|) |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset|)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 1383#(= |#memory_int| |old(#memory_int)|), 1384#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|)), 1385#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (< 0 (+ |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_dest.offset|)) (and (= |#Ultimate.C_memcpy_#t~loopctr7| 0) (or (= |#memory_int| |old(#memory_int)|) (not (= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr7|) 0))))), 1386#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr7|) (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 2 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr7|)))) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1387#(or (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~loopctr7| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 3 (+ |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_dest.offset|))), 1388#(or (and (= (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_#t~loopctr7| |#Ultimate.C_memcpy_dest.offset|) 0))) (<= 4 |#Ultimate.C_memcpy_#t~loopctr7|) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1389#(or (<= (+ |#Ultimate.C_memcpy_dest.offset| 1) 0) (<= 5 (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset|)) (= (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| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0))), 1390#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 1391#(= |main_#t~mem2| 1)] [2018-04-11 14:24:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:21,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 14:24:21,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 14:24:21,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-11 14:24:21,016 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 15 states. [2018-04-11 14:24:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:21,499 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-04-11 14:24:21,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 14:24:21,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-04-11 14:24:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:21,500 INFO L225 Difference]: With dead ends: 64 [2018-04-11 14:24:21,500 INFO L226 Difference]: Without dead ends: 64 [2018-04-11 14:24:21,500 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-04-11 14:24:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-11 14:24:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-04-11 14:24:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-11 14:24:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-04-11 14:24:21,503 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 41 [2018-04-11 14:24:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:21,503 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-04-11 14:24:21,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 14:24:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-04-11 14:24:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 14:24:21,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:21,504 INFO L355 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:21,504 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1153596448, now seen corresponding path program 1 times [2018-04-11 14:24:21,504 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:21,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:21,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:21,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 14:24:21,888 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:21,889 INFO L182 omatonBuilderFactory]: Interpolants [1542#true, 1543#false, 1544#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 1545#(and (not (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 1546#(and (not (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 1547#(and (= 2 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 1))) (not (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 1548#(= |#memory_int| |old(#memory_int)|), 1549#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1550#(or (and (or (= |#memory_int| |old(#memory_int)|) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (= |#Ultimate.C_memcpy_#t~loopctr7| 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1551#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= (+ |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_dest.offset|) 1) (< 0 (+ |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_dest.offset|))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1552#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr7|) (<= |#Ultimate.C_memcpy_#t~loopctr7| 2) (= (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))) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1553#(or (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr7|) (= (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~loopctr7| 3)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1554#(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|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1555#(and (= 2 (select (select |#memory_int| main_~p~0.base) 1)) (= 0 main_~p~0.offset)), 1556#(and (= |main_#t~mem3| 2) (= 0 main_~p~0.offset)), 1557#(= 1 (select |#valid| main_~p~0.base))] [2018-04-11 14:24:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:21,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 14:24:21,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 14:24:21,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-04-11 14:24:21,889 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 16 states. [2018-04-11 14:24:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:22,307 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2018-04-11 14:24:22,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 14:24:22,307 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-11 14:24:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:22,308 INFO L225 Difference]: With dead ends: 94 [2018-04-11 14:24:22,308 INFO L226 Difference]: Without dead ends: 94 [2018-04-11 14:24:22,308 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-04-11 14:24:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-11 14:24:22,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2018-04-11 14:24:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 14:24:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-11 14:24:22,311 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 43 [2018-04-11 14:24:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:22,312 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-11 14:24:22,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 14:24:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-11 14:24:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 14:24:22,312 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:22,312 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] [2018-04-11 14:24:22,313 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2056603010, now seen corresponding path program 2 times [2018-04-11 14:24:22,314 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:22,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:22,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:22,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 14:24:22,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:22,369 INFO L182 omatonBuilderFactory]: Interpolants [1752#true, 1753#false, 1754#(= |#Ultimate.C_memcpy_#t~loopctr7| 0), 1755#(or (<= 1 |#Ultimate.C_memcpy_#t~loopctr7|) (not (= |#Ultimate.C_memcpy_size| 4))), 1756#(or (<= 2 |#Ultimate.C_memcpy_#t~loopctr7|) (not (= |#Ultimate.C_memcpy_size| 4))), 1757#(or (<= 3 |#Ultimate.C_memcpy_#t~loopctr7|) (not (= |#Ultimate.C_memcpy_size| 4))), 1758#(or (<= 4 |#Ultimate.C_memcpy_#t~loopctr7|) (not (= |#Ultimate.C_memcpy_size| 4))), 1759#(not (= |#Ultimate.C_memcpy_size| 4))] [2018-04-11 14:24:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:22,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 14:24:22,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 14:24:22,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-11 14:24:22,370 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 8 states. [2018-04-11 14:24:22,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:22,384 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-04-11 14:24:22,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 14:24:22,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-04-11 14:24:22,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:22,385 INFO L225 Difference]: With dead ends: 62 [2018-04-11 14:24:22,385 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 14:24:22,386 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-11 14:24:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 14:24:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-04-11 14:24:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-11 14:24:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-04-11 14:24:22,388 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 44 [2018-04-11 14:24:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:22,388 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-04-11 14:24:22,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 14:24:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-04-11 14:24:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 14:24:22,389 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:22,389 INFO L355 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:22,389 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:22,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1662807508, now seen corresponding path program 1 times [2018-04-11 14:24:22,390 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:22,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:22,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:22,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 14:24:22,832 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:22,832 INFO L182 omatonBuilderFactory]: Interpolants [1888#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1889#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= |#Ultimate.C_memcpy_#t~loopctr7| 0) (or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#memory_int| |old(#memory_int)|) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)))), 1890#(or (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr7|) (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)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)))), 1891#(or (not (= |#Ultimate.C_memcpy_size| 4)) (and (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)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (< 1 (+ |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1892#(or (not (= |#Ultimate.C_memcpy_size| 4)) (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr7|) (or (<= 4 |#Ultimate.C_memcpy_#t~loopctr7|) (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|))) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 1893#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2)) (not (= |#Ultimate.C_memcpy_size| 4)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 1894#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 2)))), 1895#(and (= |main_#t~mem4| 3) (= 0 main_~p~0.offset)), 1896#(= 1 (select |#valid| main_~p~0.base)), 1881#true, 1882#false, 1883#(and (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 1884#(and (not (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 1885#(and (not (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 1886#(and (not (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base| main_~p~0.base)) (= 3 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.base|) (+ |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 2))) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields_____false_valid_free_i__d~0.offset| 0)), 1887#(= |#memory_int| |old(#memory_int)|)] [2018-04-11 14:24:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:22,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 14:24:22,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 14:24:22,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-04-11 14:24:22,832 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 16 states. [2018-04-11 14:24:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:23,242 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-04-11 14:24:23,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 14:24:23,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-04-11 14:24:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:23,242 INFO L225 Difference]: With dead ends: 55 [2018-04-11 14:24:23,242 INFO L226 Difference]: Without dead ends: 55 [2018-04-11 14:24:23,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2018-04-11 14:24:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-11 14:24:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-04-11 14:24:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 14:24:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-04-11 14:24:23,245 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 45 [2018-04-11 14:24:23,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:23,246 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-04-11 14:24:23,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 14:24:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-04-11 14:24:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 14:24:23,246 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:23,247 INFO L355 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:23,247 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:23,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1904065916, now seen corresponding path program 1 times [2018-04-11 14:24:23,248 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:23,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:24:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-11 14:24:23,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:23,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:24:23,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:23,301 INFO L182 omatonBuilderFactory]: Interpolants [2032#true, 2033#false, 2034#(= |#valid| |old(#valid)|), 2035#(= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|), 2036#(= (store |#valid| main_~p~0.base 0) |old(#valid)|)] [2018-04-11 14:24:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-11 14:24:23,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:24:23,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:24:23,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:24:23,302 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 5 states. [2018-04-11 14:24:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:23,352 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-04-11 14:24:23,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:24:23,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-04-11 14:24:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:23,353 INFO L225 Difference]: With dead ends: 54 [2018-04-11 14:24:23,353 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 14:24:23,353 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-11 14:24:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 14:24:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-11 14:24:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 14:24:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 48 transitions. [2018-04-11 14:24:23,354 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 48 transitions. Word has length 47 [2018-04-11 14:24:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:23,355 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 48 transitions. [2018-04-11 14:24:23,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:24:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 48 transitions. [2018-04-11 14:24:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 14:24:23,356 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:23,356 INFO L355 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:24:23,356 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 14:24:23,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1311537046, now seen corresponding path program 1 times [2018-04-11 14:24:23,357 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:24:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:24:23,414 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 14:24:23,426 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) [2018-04-11 14:24:23,432 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,433 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,433 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,433 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,433 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,434 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,434 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,434 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,434 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,434 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,434 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,435 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,435 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,435 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,435 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,435 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,435 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,436 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,436 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,436 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,436 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,436 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## [2018-04-11 14:24:23,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 02:24:23 BoogieIcfgContainer [2018-04-11 14:24:23,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 14:24:23,446 INFO L168 Benchmark]: Toolchain (without parser) took 4849.56 ms. Allocated memory was 405.8 MB in the beginning and 700.4 MB in the end (delta: 294.6 MB). Free memory was 342.6 MB in the beginning and 496.9 MB in the end (delta: -154.3 MB). Peak memory consumption was 140.3 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:23,447 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 405.8 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 14:24:23,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.84 ms. Allocated memory is still 405.8 MB. Free memory was 342.0 MB in the beginning and 331.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:23,448 INFO L168 Benchmark]: Boogie Preprocessor took 29.22 ms. Allocated memory is still 405.8 MB. Free memory is still 331.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 14:24:23,448 INFO L168 Benchmark]: RCFGBuilder took 338.71 ms. Allocated memory was 405.8 MB in the beginning and 590.3 MB in the end (delta: 184.5 MB). Free memory was 331.4 MB in the beginning and 547.0 MB in the end (delta: -215.6 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:23,448 INFO L168 Benchmark]: TraceAbstraction took 4305.71 ms. Allocated memory was 590.3 MB in the beginning and 700.4 MB in the end (delta: 110.1 MB). Free memory was 547.0 MB in the beginning and 496.9 MB in the end (delta: 50.1 MB). Peak memory consumption was 160.2 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:23,449 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.13 ms. Allocated memory is still 405.8 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 172.84 ms. Allocated memory is still 405.8 MB. Free memory was 342.0 MB in the beginning and 331.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.22 ms. Allocated memory is still 405.8 MB. Free memory is still 331.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 338.71 ms. Allocated memory was 405.8 MB in the beginning and 590.3 MB in the end (delta: 184.5 MB). Free memory was 331.4 MB in the beginning and 547.0 MB in the end (delta: -215.6 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4305.71 ms. Allocated memory was 590.3 MB in the beginning and 700.4 MB in the end (delta: 110.1 MB). Free memory was 547.0 MB in the beginning and 496.9 MB in the end (delta: 50.1 MB). Peak memory consumption was 160.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 16 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 14 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?pad1~ARRAY#_2_~UCHAR#?d~UINT?e~UCHAR?pad2~ARRAY#_3_~UCHAR## * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 46]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L23] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L23] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L23] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L23] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L23] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L23] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L23] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L23] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L23] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L23] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L23] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L26] struct A *p; VAL [d={18:0}] [L27] EXPR, FCALL malloc(12) VAL [d={18:0}, malloc(12)={19:0}] [L27] p = malloc(12) VAL [d={18:0}, malloc(12)={19:0}, p={19:0}] [L28] FCALL d.a = 1 VAL [d={18:0}, malloc(12)={19:0}, p={19:0}] [L29] FCALL d.b = 2 VAL [d={18:0}, malloc(12)={19:0}, p={19:0}] [L30] FCALL d.c = 3 VAL [d={18:0}, malloc(12)={19:0}, p={19:0}] [L31] FCALL d.d = 4 VAL [d={18:0}, malloc(12)={19:0}, p={19:0}] [L32] FCALL d.e = 5 VAL [d={18:0}, malloc(12)={19:0}, p={19:0}] [L33] FCALL memcpy(p, &d, 4) VAL [d={18:0}, malloc(12)={19:0}, memcpy(p, &d, 4)={19:0}, p={19:0}] [L34] EXPR, FCALL p->a VAL [d={18:0}, malloc(12)={19:0}, p={19:0}, p->a=1] [L34] COND FALSE !(p->a != 1) [L37] EXPR, FCALL p->b VAL [d={18:0}, malloc(12)={19:0}, p={19:0}, p->b=2] [L37] COND FALSE !(p->b != 2) [L40] EXPR, FCALL p->c VAL [d={18:0}, malloc(12)={19:0}, p={19:0}, p->c=3] [L40] COND FALSE !(p->c != 3) [L43] EXPR, FCALL p->d VAL [d={18:0}, malloc(12)={19:0}, p={19:0}, p->d=0] [L43] COND TRUE p->d != 4 [L44] free(p) VAL [d={18:0}, malloc(12)={19:0}, p={19:0}] [L44] free(p) VAL [d={18:0}, malloc(12)={19:0}, p={19:0}] [L44] FCALL free(p) VAL [d={18:0}, malloc(12)={19:0}, p={19:0}] [L46] free(p) VAL [d={18:0}, malloc(12)={19:0}, p={19:0}] [L46] free(p) VAL [d={18:0}, malloc(12)={19:0}, p={19:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 33 error locations. UNSAFE Result, 4.2s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 538 SDtfs, 891 SDslu, 1205 SDs, 0 SdLazy, 1703 SolverSat, 213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 22/65 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, 13 MinimizatonAttempts, 115 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 91505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 22/65 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_14-24-23-455.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_14-24-23-455.csv Received shutdown request...