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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 01:01:21,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 01:01:21,458 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 01:01:21,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 01:01:21,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 01:01:21,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 01:01:21,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 01:01:21,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 01:01:21,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 01:01:21,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 01:01:21,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 01:01:21,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 01:01:21,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 01:01:21,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 01:01:21,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 01:01:21,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 01:01:21,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 01:01:21,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 01:01:21,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 01:01:21,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 01:01:21,486 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 01:01:21,487 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 01:01:21,487 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 01:01:21,488 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 01:01:21,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 01:01:21,489 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 01:01:21,489 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 01:01:21,490 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 01:01:21,490 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 01:01:21,490 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 01:01:21,491 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 01:01:21,491 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-13 01:01:21,500 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 01:01:21,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 01:01:21,501 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 01:01:21,501 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 01:01:21,501 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 01:01:21,501 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 01:01:21,501 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 01:01:21,501 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 01:01:21,501 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 01:01:21,502 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 01:01:21,502 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 01:01:21,502 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 01:01:21,502 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 01:01:21,502 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 01:01:21,502 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 01:01:21,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 01:01:21,502 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 01:01:21,502 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 01:01:21,502 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 01:01:21,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 01:01:21,503 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 01:01:21,503 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 01:01:21,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 01:01:21,537 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 01:01:21,540 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 01:01:21,541 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 01:01:21,541 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 01:01:21,542 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_true-valid-memsafety_true-termination.i [2018-04-13 01:01:21,837 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06cc066f1 [2018-04-13 01:01:21,931 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 01:01:21,931 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 01:01:21,932 INFO L168 CDTParser]: Scanning test-bitfields-2.1_true-valid-memsafety_true-termination.i [2018-04-13 01:01:21,932 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 01:01:21,932 INFO L215 ultiparseSymbolTable]: [2018-04-13 01:01:21,933 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 01:01:21,933 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2.1_true-valid-memsafety_true-termination.i [2018-04-13 01:01:21,933 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 01:01:21,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__size_t in test-bitfields-2.1_true-valid-memsafety_true-termination.i [2018-04-13 01:01:21,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d in test-bitfields-2.1_true-valid-memsafety_true-termination.i [2018-04-13 01:01:21,945 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06cc066f1 [2018-04-13 01:01:21,948 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 01:01:21,949 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 01:01:21,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 01:01:21,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 01:01:21,953 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 01:01:21,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 01:01:21" (1/1) ... [2018-04-13 01:01:21,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6e0a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:21, skipping insertion in model container [2018-04-13 01:01:21,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 01:01:21" (1/1) ... [2018-04-13 01:01:21,967 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 01:01:21,976 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 01:01:22,069 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 01:01:22,088 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 01:01:22,094 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-13 01:01:22,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:22 WrapperNode [2018-04-13 01:01:22,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 01:01:22,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 01:01:22,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 01:01:22,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 01:01:22,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:22" (1/1) ... [2018-04-13 01:01:22,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:22" (1/1) ... [2018-04-13 01:01:22,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:22" (1/1) ... [2018-04-13 01:01:22,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:22" (1/1) ... [2018-04-13 01:01:22,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:22" (1/1) ... [2018-04-13 01:01:22,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:22" (1/1) ... [2018-04-13 01:01:22,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:22" (1/1) ... [2018-04-13 01:01:22,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 01:01:22,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 01:01:22,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 01:01:22,133 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 01:01:22,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:22" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 01:01:22,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 01:01:22,177 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 01:01:22,177 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 01:01:22,177 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-13 01:01:22,177 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-13 01:01:22,177 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 01:01:22,177 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 01:01:22,177 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 01:01:22,177 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 01:01:22,178 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-13 01:01:22,178 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 01:01:22,178 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 01:01:22,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 01:01:22,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 01:01:22,178 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 01:01:22,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 01:01:22,416 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-13 01:01:22,427 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 01:01:22,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 01:01:22 BoogieIcfgContainer [2018-04-13 01:01:22,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 01:01:22,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 01:01:22,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 01:01:22,429 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 01:01:22,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 01:01:21" (1/3) ... [2018-04-13 01:01:22,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9fb1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 01:01:22, skipping insertion in model container [2018-04-13 01:01:22,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:22" (2/3) ... [2018-04-13 01:01:22,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9fb1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 01:01:22, skipping insertion in model container [2018-04-13 01:01:22,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 01:01:22" (3/3) ... [2018-04-13 01:01:22,432 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2.1_true-valid-memsafety_true-termination.i [2018-04-13 01:01:22,437 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-13 01:01:22,443 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-04-13 01:01:22,467 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 01:01:22,468 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 01:01:22,468 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 01:01:22,468 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-13 01:01:22,468 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-13 01:01:22,468 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 01:01:22,468 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 01:01:22,468 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 01:01:22,468 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 01:01:22,469 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 01:01:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-04-13 01:01:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 01:01:22,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:22,488 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:22,488 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-13 01:01:22,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2093293613, now seen corresponding path program 1 times [2018-04-13 01:01:22,523 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:22,570 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:22,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:01:22,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 01:01:22,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:22,665 INFO L182 omatonBuilderFactory]: Interpolants [89#true, 90#false, 91#(and (= 5 (select |#length| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0) (= (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|) 1)), 92#(and (= 5 (select |#length| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0) (not (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base| |main_#t~malloc0.base|))), 93#(and (= 5 (select |#length| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|)) (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0))] [2018-04-13 01:01:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:22,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:01:22,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:01:22,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:01:22,681 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 5 states. [2018-04-13 01:01:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:22,845 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-04-13 01:01:22,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 01:01:22,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-13 01:01:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:22,856 INFO L225 Difference]: With dead ends: 106 [2018-04-13 01:01:22,856 INFO L226 Difference]: Without dead ends: 103 [2018-04-13 01:01:22,858 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-13 01:01:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-13 01:01:22,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2018-04-13 01:01:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-13 01:01:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-04-13 01:01:22,885 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 15 [2018-04-13 01:01:22,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:22,885 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-04-13 01:01:22,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:01:22,886 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-04-13 01:01:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 01:01:22,886 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:22,886 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:22,887 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-13 01:01:22,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1599495017, now seen corresponding path program 1 times [2018-04-13 01:01:22,888 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:22,907 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:22,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:01:22,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 01:01:22,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:22,944 INFO L182 omatonBuilderFactory]: Interpolants [273#true, 274#false, 275#(and (= 3 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 276#(and (= main_~p~0.offset 0) (= 3 (select |#length| main_~p~0.base)))] [2018-04-13 01:01:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:22,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:01:22,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:01:22,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:01:22,946 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 4 states. [2018-04-13 01:01:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:23,013 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-04-13 01:01:23,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 01:01:23,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-13 01:01:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:23,015 INFO L225 Difference]: With dead ends: 51 [2018-04-13 01:01:23,015 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 01:01:23,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:01:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 01:01:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-13 01:01:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 01:01:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-04-13 01:01:23,020 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2018-04-13 01:01:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:23,020 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-04-13 01:01:23,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:01:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-04-13 01:01:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 01:01:23,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:23,021 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:23,021 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-13 01:01:23,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1599495015, now seen corresponding path program 1 times [2018-04-13 01:01:23,022 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:23,034 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:01:23,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 01:01:23,060 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,061 INFO L182 omatonBuilderFactory]: Interpolants [384#(= 1 (select |#valid| main_~p~0.base)), 381#true, 382#false, 383#(= 1 (select |#valid| |main_#t~malloc0.base|))] [2018-04-13 01:01:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:01:23,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:01:23,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:01:23,062 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2018-04-13 01:01:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:23,126 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-04-13 01:01:23,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 01:01:23,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-13 01:01:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:23,127 INFO L225 Difference]: With dead ends: 61 [2018-04-13 01:01:23,127 INFO L226 Difference]: Without dead ends: 61 [2018-04-13 01:01:23,128 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:01:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-04-13 01:01:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2018-04-13 01:01:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-13 01:01:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-04-13 01:01:23,132 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-04-13 01:01:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:23,132 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-04-13 01:01:23,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:01:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-04-13 01:01:23,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 01:01:23,133 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:23,133 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:23,133 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-13 01:01:23,134 INFO L82 PathProgramCache]: Analyzing trace with hash -472719528, now seen corresponding path program 1 times [2018-04-13 01:01:23,135 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:23,154 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:01:23,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 01:01:23,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,197 INFO L182 omatonBuilderFactory]: Interpolants [497#true, 498#false, 499#(or (= |#Ultimate.C_memcpy_#t~loopctr7| 0) (not (= |#Ultimate.C_memcpy_size| 3))), 500#(not (= |#Ultimate.C_memcpy_size| 3))] [2018-04-13 01:01:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:01:23,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:01:23,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:01:23,197 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 4 states. [2018-04-13 01:01:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:23,212 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-04-13 01:01:23,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 01:01:23,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-13 01:01:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:23,213 INFO L225 Difference]: With dead ends: 52 [2018-04-13 01:01:23,213 INFO L226 Difference]: Without dead ends: 50 [2018-04-13 01:01:23,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:01:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-13 01:01:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-13 01:01:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 01:01:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-04-13 01:01:23,215 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 32 [2018-04-13 01:01:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:23,216 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-04-13 01:01:23,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:01:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-04-13 01:01:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 01:01:23,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:23,216 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:23,216 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-13 01:01:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1743500461, now seen corresponding path program 1 times [2018-04-13 01:01:23,217 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:23,233 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:23,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-13 01:01:23,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,273 INFO L182 omatonBuilderFactory]: Interpolants [603#true, 604#false, 605#(or (= |#Ultimate.C_memcpy_#t~loopctr7| 0) (not (= |#Ultimate.C_memcpy_size| 3))), 606#(or (<= |#Ultimate.C_memcpy_#t~loopctr7| 1) (not (= |#Ultimate.C_memcpy_size| 3))), 607#(not (= |#Ultimate.C_memcpy_size| 3))] [2018-04-13 01:01:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:01:23,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:01:23,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:01:23,273 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-04-13 01:01:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:23,288 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-04-13 01:01:23,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 01:01:23,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-04-13 01:01:23,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:23,290 INFO L225 Difference]: With dead ends: 53 [2018-04-13 01:01:23,290 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 01:01:23,290 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:01:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 01:01:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-13 01:01:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 01:01:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-04-13 01:01:23,295 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 33 [2018-04-13 01:01:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:23,296 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-04-13 01:01:23,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:01:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-04-13 01:01:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 01:01:23,297 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:23,297 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:23,297 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-13 01:01:23,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1726843384, now seen corresponding path program 2 times [2018-04-13 01:01:23,298 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:23,314 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:23,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-13 01:01:23,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,348 INFO L182 omatonBuilderFactory]: Interpolants [712#true, 713#false, 714#(or (= |#Ultimate.C_memcpy_#t~loopctr7| 0) (not (= |#Ultimate.C_memcpy_size| 3))), 715#(or (<= |#Ultimate.C_memcpy_#t~loopctr7| 1) (not (= |#Ultimate.C_memcpy_size| 3))), 716#(or (<= |#Ultimate.C_memcpy_#t~loopctr7| 2) (not (= |#Ultimate.C_memcpy_size| 3))), 717#(not (= |#Ultimate.C_memcpy_size| 3))] [2018-04-13 01:01:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 01:01:23,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 01:01:23,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-13 01:01:23,348 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-04-13 01:01:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:23,360 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-04-13 01:01:23,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 01:01:23,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-13 01:01:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:23,364 INFO L225 Difference]: With dead ends: 54 [2018-04-13 01:01:23,364 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 01:01:23,364 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-13 01:01:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 01:01:23,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-13 01:01:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 01:01:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-04-13 01:01:23,366 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 34 [2018-04-13 01:01:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:23,366 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-04-13 01:01:23,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 01:01:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-04-13 01:01:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 01:01:23,367 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:23,367 INFO L355 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:23,367 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-13 01:01:23,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1210473997, now seen corresponding path program 3 times [2018-04-13 01:01:23,368 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:23,393 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:23,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 01:01:23,714 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,714 INFO L182 omatonBuilderFactory]: Interpolants [832#(or (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 3)) (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))))), 833#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (= (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|))) (< 0 (+ |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_size| 3))), 834#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 3 (+ |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_dest.offset|))) (< 1 (+ |#Ultimate.C_memcpy_#t~loopctr7| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_size| 3))), 835#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 3))), 836#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 837#(= |main_#t~mem2| 1), 838#(= 1 (select |#valid| main_~p~0.base)), 824#true, 825#false, 826#(= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0), 827#(and (= |main_#t~malloc0.offset| 0) (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0)), 828#(and (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0)), 829#(and (= 1 (select (select |#memory_int| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|) |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|)) (= 0 main_~p~0.offset) (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0)), 830#(= |#memory_int| |old(#memory_int)|), 831#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|) (not (= |#Ultimate.C_memcpy_size| 3)))] [2018-04-13 01:01:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:23,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 01:01:23,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 01:01:23,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-04-13 01:01:23,715 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 15 states. [2018-04-13 01:01:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:24,014 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-04-13 01:01:24,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 01:01:24,014 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-13 01:01:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:24,015 INFO L225 Difference]: With dead ends: 48 [2018-04-13 01:01:24,015 INFO L226 Difference]: Without dead ends: 48 [2018-04-13 01:01:24,015 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-04-13 01:01:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-13 01:01:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-04-13 01:01:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 01:01:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-04-13 01:01:24,017 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 35 [2018-04-13 01:01:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:24,017 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-04-13 01:01:24,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 01:01:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-04-13 01:01:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 01:01:24,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:24,018 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] [2018-04-13 01:01:24,018 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-13 01:01:24,018 INFO L82 PathProgramCache]: Analyzing trace with hash -922618454, now seen corresponding path program 1 times [2018-04-13 01:01:24,018 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 01:01:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 01:01:24,078 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-13 01:01:24,090 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) [2018-04-13 01:01:24,096 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,096 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,096 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,097 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,097 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,097 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,097 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,098 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,098 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,098 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,098 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,098 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# [2018-04-13 01:01:24,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 01:01:24 BoogieIcfgContainer [2018-04-13 01:01:24,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 01:01:24,107 INFO L168 Benchmark]: Toolchain (without parser) took 2158.54 ms. Allocated memory was 402.7 MB in the beginning and 635.4 MB in the end (delta: 232.8 MB). Free memory was 344.9 MB in the beginning and 473.9 MB in the end (delta: -129.0 MB). Peak memory consumption was 103.7 MB. Max. memory is 5.3 GB. [2018-04-13 01:01:24,108 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 01:01:24,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.52 ms. Allocated memory is still 402.7 MB. Free memory was 344.9 MB in the beginning and 334.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-13 01:01:24,109 INFO L168 Benchmark]: Boogie Preprocessor took 28.62 ms. Allocated memory is still 402.7 MB. Free memory was 334.3 MB in the beginning and 333.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 01:01:24,109 INFO L168 Benchmark]: RCFGBuilder took 294.67 ms. Allocated memory was 402.7 MB in the beginning and 606.1 MB in the end (delta: 203.4 MB). Free memory was 333.0 MB in the beginning and 561.1 MB in the end (delta: -228.1 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. [2018-04-13 01:01:24,109 INFO L168 Benchmark]: TraceAbstraction took 1679.07 ms. Allocated memory was 606.1 MB in the beginning and 635.4 MB in the end (delta: 29.4 MB). Free memory was 561.1 MB in the beginning and 473.9 MB in the end (delta: 87.2 MB). Peak memory consumption was 116.6 MB. Max. memory is 5.3 GB. [2018-04-13 01:01:24,112 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.52 ms. Allocated memory is still 402.7 MB. Free memory was 344.9 MB in the beginning and 334.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.62 ms. Allocated memory is still 402.7 MB. Free memory was 334.3 MB in the beginning and 333.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 294.67 ms. Allocated memory was 402.7 MB in the beginning and 606.1 MB in the end (delta: 203.4 MB). Free memory was 333.0 MB in the beginning and 561.1 MB in the end (delta: -228.1 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1679.07 ms. Allocated memory was 606.1 MB in the beginning and 635.4 MB in the end (delta: 29.4 MB). Free memory was 561.1 MB in the beginning and 473.9 MB in the end (delta: 87.2 MB). Peak memory consumption was 116.6 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 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 9 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 41]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={6:0}] [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={6:0}] [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={6:0}] [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={6:0}] [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={6:0}] [L21] FCALL struct A d; VAL [\old(d)=null, \old(d)=null, d={6:0}] [L24] struct A *p; VAL [d={6:0}] [L25] EXPR, FCALL malloc(3) VAL [d={6:0}, malloc(3)={8:0}] [L25] p = malloc(3) VAL [d={6:0}, malloc(3)={8:0}, p={8:0}] [L26] FCALL d.a = 1 VAL [d={6:0}, malloc(3)={8:0}, p={8:0}] [L27] FCALL d.b = 2 VAL [d={6:0}, malloc(3)={8:0}, p={8:0}] [L28] FCALL d.c = 3 VAL [d={6:0}, malloc(3)={8:0}, p={8:0}] [L29] FCALL d.d = 4 VAL [d={6:0}, malloc(3)={8:0}, p={8:0}] [L30] FCALL d.e = 5 VAL [d={6:0}, malloc(3)={8:0}, p={8:0}] [L31] FCALL memcpy(p, &d, 3) VAL [d={6:0}, malloc(3)={8:0}, memcpy(p, &d, 3)={8:0}, p={8:0}] [L32] EXPR, FCALL p->a VAL [d={6:0}, malloc(3)={8:0}, p={8:0}, p->a=1] [L32] COND FALSE !(p->a != 1) [L35] EXPR, FCALL p->b VAL [d={6:0}, malloc(3)={8:0}, p={8:0}, p->b=2] [L35] COND FALSE !(p->b != 2) [L38] EXPR, FCALL p->c VAL [d={6:0}, malloc(3)={8:0}, p={8:0}, p->c=3] [L38] COND FALSE !(p->c != 3) [L41] FCALL p->d - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 33 error locations. UNSAFE Result, 1.6s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 251 SDtfs, 361 SDslu, 451 SDs, 0 SdLazy, 490 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1/10 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, 7 MinimizatonAttempts, 45 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 20740 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 1/10 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_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_01-01-24-117.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_01-01-24-117.csv Received shutdown request...