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-3.1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 14:23:52,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 14:23:52,576 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 14:23:52,588 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 14:23:52,588 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 14:23:52,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 14:23:52,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 14:23:52,590 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 14:23:52,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 14:23:52,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 14:23:52,593 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 14:23:52,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 14:23:52,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 14:23:52,595 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 14:23:52,596 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 14:23:52,598 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 14:23:52,600 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 14:23:52,601 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 14:23:52,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 14:23:52,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 14:23:52,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 14:23:52,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 14:23:52,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 14:23:52,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 14:23:52,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 14:23:52,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 14:23:52,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 14:23:52,609 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 14:23:52,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 14:23:52,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 14:23:52,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 14:23:52,610 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:23:52,632 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 14:23:52,632 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 14:23:52,633 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 14:23:52,633 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 14:23:52,633 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 14:23:52,633 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 14:23:52,633 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 14:23:52,634 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 14:23:52,634 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 14:23:52,634 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 14:23:52,634 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 14:23:52,634 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 14:23:52,634 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 14:23:52,634 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 14:23:52,635 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 14:23:52,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 14:23:52,635 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 14:23:52,635 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 14:23:52,635 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 14:23:52,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 14:23:52,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 14:23:52,636 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:23:52,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 14:23:52,677 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 14:23:52,681 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 14:23:52,682 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 14:23:52,682 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 14:23:52,683 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-3.1_true-valid-memsafety_true-termination.i [2018-04-11 14:23:52,963 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6e602e28c [2018-04-11 14:23:53,079 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 14:23:53,079 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 14:23:53,080 INFO L168 CDTParser]: Scanning test-bitfields-3.1_true-valid-memsafety_true-termination.i [2018-04-11 14:23:53,081 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 14:23:53,081 INFO L215 ultiparseSymbolTable]: [2018-04-11 14:23:53,081 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 14:23:53,081 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3.1_true-valid-memsafety_true-termination.i [2018-04-11 14:23:53,081 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 14:23:53,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d in test-bitfields-3.1_true-valid-memsafety_true-termination.i [2018-04-11 14:23:53,081 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__size_t in test-bitfields-3.1_true-valid-memsafety_true-termination.i [2018-04-11 14:23:53,094 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6e602e28c [2018-04-11 14:23:53,098 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 14:23:53,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 14:23:53,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 14:23:53,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 14:23:53,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 14:23:53,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:23:53" (1/1) ... [2018-04-11 14:23:53,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612ebba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:53, skipping insertion in model container [2018-04-11 14:23:53,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:23:53" (1/1) ... [2018-04-11 14:23:53,120 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:23:53,128 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:23:53,222 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:23:53,246 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:23:53,252 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 14:23:53,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:53 WrapperNode [2018-04-11 14:23:53,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 14:23:53,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 14:23:53,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 14:23:53,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 14:23:53,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:53" (1/1) ... [2018-04-11 14:23:53,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:53" (1/1) ... [2018-04-11 14:23:53,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:53" (1/1) ... [2018-04-11 14:23:53,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:53" (1/1) ... [2018-04-11 14:23:53,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:53" (1/1) ... [2018-04-11 14:23:53,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:53" (1/1) ... [2018-04-11 14:23:53,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:53" (1/1) ... [2018-04-11 14:23:53,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 14:23:53,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 14:23:53,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 14:23:53,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 14:23:53,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:53" (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:23:53,329 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 14:23:53,329 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 14:23:53,329 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 14:23:53,329 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 14:23:53,329 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 14:23:53,329 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 14:23:53,329 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 14:23:53,329 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 14:23:53,329 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 14:23:53,329 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 14:23:53,330 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 14:23:53,330 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 14:23:53,330 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 14:23:53,330 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 14:23:53,330 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 14:23:53,330 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 14:23:53,635 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 14:23:53,651 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 14:23:53,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:23:53 BoogieIcfgContainer [2018-04-11 14:23:53,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 14:23:53,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 14:23:53,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 14:23:53,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 14:23:53,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 02:23:53" (1/3) ... [2018-04-11 14:23:53,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e87dfa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:23:53, skipping insertion in model container [2018-04-11 14:23:53,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:23:53" (2/3) ... [2018-04-11 14:23:53,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e87dfa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:23:53, skipping insertion in model container [2018-04-11 14:23:53,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:23:53" (3/3) ... [2018-04-11 14:23:53,656 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3.1_true-valid-memsafety_true-termination.i [2018-04-11 14:23:53,663 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 14:23:53,670 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-04-11 14:23:53,697 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 14:23:53,698 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 14:23:53,698 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 14:23:53,698 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 14:23:53,698 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 14:23:53,698 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 14:23:53,698 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 14:23:53,698 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 14:23:53,698 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 14:23:53,699 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 14:23:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-04-11 14:23:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 14:23:53,716 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:53,717 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:23:53,717 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1496282770, now seen corresponding path program 1 times [2018-04-11 14:23:53,752 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:53,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:53,851 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:23:53,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:23:53,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:23:53,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:53,854 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:23:53,855 INFO L182 omatonBuilderFactory]: Interpolants [97#true, 98#false, 99#(= 1 (select |#valid| |main_#t~malloc0.base|)), 100#(= 1 (select |#valid| main_~p~0.base))] [2018-04-11 14:23:53,855 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:23:53,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:23:53,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:23:53,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:23:53,866 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 4 states. [2018-04-11 14:23:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:54,023 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-04-11 14:23:54,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:23:54,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 14:23:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:54,036 INFO L225 Difference]: With dead ends: 137 [2018-04-11 14:23:54,036 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 14:23:54,038 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:23:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 14:23:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 90. [2018-04-11 14:23:54,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-11 14:23:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-04-11 14:23:54,069 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 20 [2018-04-11 14:23:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:54,070 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-04-11 14:23:54,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:23:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-04-11 14:23:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 14:23:54,071 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:54,071 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:23:54,071 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1496282769, now seen corresponding path program 1 times [2018-04-11 14:23:54,072 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:54,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:54,145 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:23:54,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:23:54,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 14:23:54,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:54,146 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:23:54,146 INFO L182 omatonBuilderFactory]: Interpolants [330#true, 331#false, 332#(= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|))] [2018-04-11 14:23:54,146 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:23:54,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 14:23:54,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 14:23:54,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 14:23:54,148 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 3 states. [2018-04-11 14:23:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:54,216 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2018-04-11 14:23:54,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 14:23:54,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-04-11 14:23:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:54,217 INFO L225 Difference]: With dead ends: 127 [2018-04-11 14:23:54,217 INFO L226 Difference]: Without dead ends: 127 [2018-04-11 14:23:54,218 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:23:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-11 14:23:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 89. [2018-04-11 14:23:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 14:23:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-04-11 14:23:54,224 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 20 [2018-04-11 14:23:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:54,224 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-04-11 14:23:54,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 14:23:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-04-11 14:23:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 14:23:54,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:54,225 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:23:54,225 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:54,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1496282768, now seen corresponding path program 1 times [2018-04-11 14:23:54,226 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:54,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:54,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:23:54,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:23:54,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:54,288 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:23:54,288 INFO L182 omatonBuilderFactory]: Interpolants [549#true, 550#false, 551#(and (= 0 |main_#t~malloc0.offset|) (= 10 (select |#length| |main_#t~malloc0.base|))), 552#(and (= 10 (select |#length| main_~p~0.base)) (= main_~p~0.offset 0))] [2018-04-11 14:23:54,289 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:23:54,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:23:54,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:23:54,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:23:54,289 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 4 states. [2018-04-11 14:23:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:54,369 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-04-11 14:23:54,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:23:54,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 14:23:54,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:54,370 INFO L225 Difference]: With dead ends: 75 [2018-04-11 14:23:54,371 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 14:23:54,371 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:23:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 14:23:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-11 14:23:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 14:23:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-04-11 14:23:54,376 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 20 [2018-04-11 14:23:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:54,376 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-04-11 14:23:54,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:23:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-04-11 14:23:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 14:23:54,377 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:54,377 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:23:54,377 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:54,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1496282767, now seen corresponding path program 1 times [2018-04-11 14:23:54,378 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:54,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:54,431 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:23:54,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:23:54,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 14:23:54,432 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:54,432 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:23:54,432 INFO L182 omatonBuilderFactory]: Interpolants [705#true, 706#false, 707#(and (= 10 (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-11 14:23:54,432 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:23:54,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 14:23:54,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 14:23:54,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 14:23:54,432 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 3 states. [2018-04-11 14:23:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:54,459 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-04-11 14:23:54,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 14:23:54,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-04-11 14:23:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:54,461 INFO L225 Difference]: With dead ends: 74 [2018-04-11 14:23:54,461 INFO L226 Difference]: Without dead ends: 74 [2018-04-11 14:23:54,462 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:23:54,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-11 14:23:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-04-11 14:23:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 14:23:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-04-11 14:23:54,466 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 20 [2018-04-11 14:23:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:54,467 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-04-11 14:23:54,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 14:23:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-04-11 14:23:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 14:23:54,468 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:54,468 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-11 14:23:54,468 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:54,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1289574177, now seen corresponding path program 1 times [2018-04-11 14:23:54,469 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:54,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:54,548 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:23:54,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:23:54,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:23:54,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:54,549 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:23:54,549 INFO L182 omatonBuilderFactory]: Interpolants [856#true, 857#false, 858#(= |#Ultimate.C_memcpy_#t~loopctr9| 0), 859#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:23:54,549 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:23:54,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:23:54,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:23:54,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:23:54,551 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2018-04-11 14:23:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:54,565 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-04-11 14:23:54,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:23:54,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-11 14:23:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:54,567 INFO L225 Difference]: With dead ends: 77 [2018-04-11 14:23:54,567 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 14:23:54,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:23:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 14:23:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-11 14:23:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 14:23:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-04-11 14:23:54,571 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 32 [2018-04-11 14:23:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:54,571 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-04-11 14:23:54,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:23:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-04-11 14:23:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 14:23:54,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:54,572 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:23:54,572 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash -550108064, now seen corresponding path program 1 times [2018-04-11 14:23:54,573 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:54,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:54,626 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:23:54,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:54,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-11 14:23:54,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:54,627 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:23:54,627 INFO L182 omatonBuilderFactory]: Interpolants [1014#true, 1015#false, 1016#(or (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1017#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 1)), 1018#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:23:54,627 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:23:54,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:23:54,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:23:54,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:23:54,628 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 5 states. [2018-04-11 14:23:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:54,640 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2018-04-11 14:23:54,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:23:54,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-04-11 14:23:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:54,641 INFO L225 Difference]: With dead ends: 78 [2018-04-11 14:23:54,641 INFO L226 Difference]: Without dead ends: 76 [2018-04-11 14:23:54,641 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:23:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-11 14:23:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-04-11 14:23:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-11 14:23:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-04-11 14:23:54,645 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 33 [2018-04-11 14:23:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:54,645 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-04-11 14:23:54,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:23:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-04-11 14:23:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 14:23:54,646 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:54,646 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:23:54,647 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:54,647 INFO L82 PathProgramCache]: Analyzing trace with hash 898504959, now seen corresponding path program 2 times [2018-04-11 14:23:54,647 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:54,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:54,720 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:23:54,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:54,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 14:23:54,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:54,721 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:23:54,721 INFO L182 omatonBuilderFactory]: Interpolants [1173#true, 1174#false, 1175#(or (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1176#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 1)), 1177#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 2) (not (= |#Ultimate.C_memcpy_size| 10))), 1178#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:23:54,721 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:23:54,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:23:54,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:23:54,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:23:54,722 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2018-04-11 14:23:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:54,737 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-04-11 14:23:54,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:23:54,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-11 14:23:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:54,738 INFO L225 Difference]: With dead ends: 79 [2018-04-11 14:23:54,738 INFO L226 Difference]: Without dead ends: 77 [2018-04-11 14:23:54,739 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:23:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-11 14:23:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-04-11 14:23:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-11 14:23:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-04-11 14:23:54,742 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 34 [2018-04-11 14:23:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:54,743 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-04-11 14:23:54,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:23:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-04-11 14:23:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 14:23:54,743 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:54,743 INFO L355 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:23:54,744 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:54,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1439131584, now seen corresponding path program 3 times [2018-04-11 14:23:54,744 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:54,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:54,809 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:23:54,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:54,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 14:23:54,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:54,810 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:23:54,810 INFO L182 omatonBuilderFactory]: Interpolants [1335#true, 1336#false, 1337#(or (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1338#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 1)), 1339#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 2) (not (= |#Ultimate.C_memcpy_size| 10))), 1340#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 3) (not (= |#Ultimate.C_memcpy_size| 10))), 1341#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:23:54,810 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:23:54,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 14:23:54,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 14:23:54,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:23:54,811 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-04-11 14:23:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:54,828 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-04-11 14:23:54,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 14:23:54,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-04-11 14:23:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:54,829 INFO L225 Difference]: With dead ends: 80 [2018-04-11 14:23:54,829 INFO L226 Difference]: Without dead ends: 78 [2018-04-11 14:23:54,829 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:23:54,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-11 14:23:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-11 14:23:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 14:23:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-04-11 14:23:54,832 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 35 [2018-04-11 14:23:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:54,833 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-04-11 14:23:54,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 14:23:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-04-11 14:23:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 14:23:54,834 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:54,834 INFO L355 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:23:54,834 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:54,834 INFO L82 PathProgramCache]: Analyzing trace with hash -891420385, now seen corresponding path program 4 times [2018-04-11 14:23:54,835 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:54,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:54,917 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:23:54,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:54,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 14:23:54,918 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:54,918 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:23:54,918 INFO L182 omatonBuilderFactory]: Interpolants [1504#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 2) (not (= |#Ultimate.C_memcpy_size| 10))), 1505#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 3) (not (= |#Ultimate.C_memcpy_size| 10))), 1506#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 1507#(not (= |#Ultimate.C_memcpy_size| 10)), 1500#true, 1501#false, 1502#(or (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1503#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 1))] [2018-04-11 14:23:54,918 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:23:54,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 14:23:54,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 14:23:54,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-11 14:23:54,919 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 8 states. [2018-04-11 14:23:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:54,937 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-04-11 14:23:54,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 14:23:54,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-04-11 14:23:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:54,938 INFO L225 Difference]: With dead ends: 81 [2018-04-11 14:23:54,938 INFO L226 Difference]: Without dead ends: 79 [2018-04-11 14:23:54,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-11 14:23:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-04-11 14:23:54,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-04-11 14:23:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 14:23:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-11 14:23:54,942 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 36 [2018-04-11 14:23:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:54,942 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-11 14:23:54,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 14:23:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-11 14:23:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 14:23:54,943 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:54,943 INFO L355 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:23:54,943 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:54,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1092242400, now seen corresponding path program 5 times [2018-04-11 14:23:54,944 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:54,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:55,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:55,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 14:23:55,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:55,031 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:23:55,031 INFO L182 omatonBuilderFactory]: Interpolants [1668#true, 1669#false, 1670#(or (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1671#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 1)), 1672#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 2) (not (= |#Ultimate.C_memcpy_size| 10))), 1673#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 3) (not (= |#Ultimate.C_memcpy_size| 10))), 1674#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 1675#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 1676#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:23:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:55,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 14:23:55,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 14:23:55,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:23:55,031 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 9 states. [2018-04-11 14:23:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:55,058 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-04-11 14:23:55,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 14:23:55,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-04-11 14:23:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:55,058 INFO L225 Difference]: With dead ends: 82 [2018-04-11 14:23:55,058 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 14:23:55,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:23:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 14:23:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-11 14:23:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-11 14:23:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-04-11 14:23:55,061 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 37 [2018-04-11 14:23:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:55,062 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-04-11 14:23:55,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 14:23:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-04-11 14:23:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 14:23:55,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:55,063 INFO L355 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:23:55,063 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:55,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1272209727, now seen corresponding path program 6 times [2018-04-11 14:23:55,064 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:55,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:55,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:55,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 14:23:55,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:55,159 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:23:55,160 INFO L182 omatonBuilderFactory]: Interpolants [1840#false, 1841#(or (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1842#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 1)), 1843#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 2) (not (= |#Ultimate.C_memcpy_size| 10))), 1844#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 3) (not (= |#Ultimate.C_memcpy_size| 10))), 1845#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 1846#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 1847#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 6)), 1848#(not (= |#Ultimate.C_memcpy_size| 10)), 1839#true] [2018-04-11 14:23:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:55,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 14:23:55,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 14:23:55,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-11 14:23:55,160 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 10 states. [2018-04-11 14:23:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:55,184 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-04-11 14:23:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 14:23:55,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-11 14:23:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:55,185 INFO L225 Difference]: With dead ends: 83 [2018-04-11 14:23:55,185 INFO L226 Difference]: Without dead ends: 81 [2018-04-11 14:23:55,185 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-11 14:23:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-11 14:23:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-11 14:23:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-11 14:23:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-04-11 14:23:55,187 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 38 [2018-04-11 14:23:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:55,187 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-04-11 14:23:55,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 14:23:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-04-11 14:23:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 14:23:55,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:55,188 INFO L355 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:55,188 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:55,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1555781632, now seen corresponding path program 7 times [2018-04-11 14:23:55,188 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:55,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:55,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:55,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 14:23:55,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:55,282 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:23:55,282 INFO L182 omatonBuilderFactory]: Interpolants [2016#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 1)), 2017#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 2) (not (= |#Ultimate.C_memcpy_size| 10))), 2018#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 3) (not (= |#Ultimate.C_memcpy_size| 10))), 2019#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2020#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 2021#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 6)), 2022#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 7) (not (= |#Ultimate.C_memcpy_size| 10))), 2023#(not (= |#Ultimate.C_memcpy_size| 10)), 2013#true, 2014#false, 2015#(or (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (not (= |#Ultimate.C_memcpy_size| 10)))] [2018-04-11 14:23:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:55,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 14:23:55,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 14:23:55,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-11 14:23:55,283 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 11 states. [2018-04-11 14:23:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:55,311 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-04-11 14:23:55,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 14:23:55,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-04-11 14:23:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:55,312 INFO L225 Difference]: With dead ends: 84 [2018-04-11 14:23:55,312 INFO L226 Difference]: Without dead ends: 82 [2018-04-11 14:23:55,312 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-11 14:23:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-11 14:23:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-04-11 14:23:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 14:23:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-04-11 14:23:55,315 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 39 [2018-04-11 14:23:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:55,315 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-04-11 14:23:55,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 14:23:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-04-11 14:23:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 14:23:55,316 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:55,316 INFO L355 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:55,316 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:55,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1756576095, now seen corresponding path program 8 times [2018-04-11 14:23:55,317 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:55,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:55,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:55,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 14:23:55,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:55,427 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:23:55,428 INFO L182 omatonBuilderFactory]: Interpolants [2192#(or (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2193#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 1)), 2194#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 2) (not (= |#Ultimate.C_memcpy_size| 10))), 2195#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 3) (not (= |#Ultimate.C_memcpy_size| 10))), 2196#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2197#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 2198#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 6)), 2199#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 7) (not (= |#Ultimate.C_memcpy_size| 10))), 2200#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 8)), 2201#(not (= |#Ultimate.C_memcpy_size| 10)), 2190#true, 2191#false] [2018-04-11 14:23:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:55,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 14:23:55,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 14:23:55,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-11 14:23:55,429 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 12 states. [2018-04-11 14:23:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:55,451 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-04-11 14:23:55,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 14:23:55,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-04-11 14:23:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:55,453 INFO L225 Difference]: With dead ends: 85 [2018-04-11 14:23:55,453 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 14:23:55,453 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-11 14:23:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 14:23:55,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-11 14:23:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 14:23:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-04-11 14:23:55,455 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 40 [2018-04-11 14:23:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:55,455 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-04-11 14:23:55,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 14:23:55,455 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-04-11 14:23:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 14:23:55,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:55,456 INFO L355 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:55,456 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:55,457 INFO L82 PathProgramCache]: Analyzing trace with hash -608730144, now seen corresponding path program 9 times [2018-04-11 14:23:55,457 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:55,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:55,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:55,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 14:23:55,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:55,579 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:23:55,579 INFO L182 omatonBuilderFactory]: Interpolants [2370#true, 2371#false, 2372#(or (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2373#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 1)), 2374#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 2) (not (= |#Ultimate.C_memcpy_size| 10))), 2375#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 3) (not (= |#Ultimate.C_memcpy_size| 10))), 2376#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2377#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 2378#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 6)), 2379#(or (<= |#Ultimate.C_memcpy_#t~loopctr9| 7) (not (= |#Ultimate.C_memcpy_size| 10))), 2380#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 8)), 2381#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr9| 9)), 2382#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-11 14:23:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:55,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 14:23:55,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 14:23:55,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-11 14:23:55,580 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 13 states. [2018-04-11 14:23:55,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:55,602 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-04-11 14:23:55,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 14:23:55,603 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-04-11 14:23:55,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:55,604 INFO L225 Difference]: With dead ends: 86 [2018-04-11 14:23:55,604 INFO L226 Difference]: Without dead ends: 84 [2018-04-11 14:23:55,604 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-11 14:23:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-11 14:23:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-11 14:23:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-11 14:23:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-04-11 14:23:55,606 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 41 [2018-04-11 14:23:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:55,607 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-04-11 14:23:55,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 14:23:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-04-11 14:23:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 14:23:55,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:55,608 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:55,608 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash -918779521, now seen corresponding path program 10 times [2018-04-11 14:23:55,608 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:55,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:56,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:56,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 14:23:56,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:56,231 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:23:56,231 INFO L182 omatonBuilderFactory]: Interpolants [2560#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|)), 2561#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (= |#memory_int| |old(#memory_int)|))), 2562#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr9|) (or (<= 2 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (= (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_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 2563#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (<= 3 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (= (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))) (<= 2 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)))), 2564#(or (and (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)) (<= 4 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|))) (<= 3 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 2565#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (= (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|) 4) (< 4 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (or (<= 5 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (= (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))))), 2566#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 5 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)) (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)))) (<= 6 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))), 2567#(or (<= 7 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)) (and (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))) (<= 6 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 2568#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 8 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)) (and (<= 7 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)) (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))))), 2569#(or (<= 9 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)) (and (<= 8 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)) (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_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 2570#(or (not (= |#Ultimate.C_memcpy_size| 10)) (and (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= 10 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (not (= |#Ultimate.C_memcpy_src.offset| 0))) (not (= 0 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)))) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 2571#(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_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 2572#(= 0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 2573#(= |main_#t~mem2| 0), 2574#(= 1 (select |#valid| main_~p~0.base)), 2553#true, 2554#false, 2555#(= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0), 2556#(and (= 0 (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|)) (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0)), 2557#(and (= 0 (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|)) (= |main_#t~malloc0.offset| 0) (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0)), 2558#(and (= 0 (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)), 2559#(= |#memory_int| |old(#memory_int)|)] [2018-04-11 14:23:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:56,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 14:23:56,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 14:23:56,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-04-11 14:23:56,232 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 22 states. [2018-04-11 14:23:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:56,840 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-04-11 14:23:56,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 14:23:56,840 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-04-11 14:23:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:56,841 INFO L225 Difference]: With dead ends: 80 [2018-04-11 14:23:56,841 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 14:23:56,841 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 14:23:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 14:23:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-04-11 14:23:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 14:23:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-04-11 14:23:56,844 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 42 [2018-04-11 14:23:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:56,844 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-04-11 14:23:56,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 14:23:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-04-11 14:23:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 14:23:56,845 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:56,845 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:56,845 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:56,845 INFO L82 PathProgramCache]: Analyzing trace with hash -351289301, now seen corresponding path program 1 times [2018-04-11 14:23:56,846 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:56,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:57,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:57,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 14:23:57,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:57,427 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:23:57,428 INFO L182 omatonBuilderFactory]: Interpolants [2784#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))), 2785#(and (= 2 (select (select |#memory_int| main_~p~0.base) 1)) (= 0 main_~p~0.offset)), 2786#(= |main_#t~mem3| 2), 2787#(= 1 (select |#valid| main_~p~0.base)), 2766#true, 2767#false, 2768#(and (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|))), 2769#(and (= 2 (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| 1))) (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|))), 2770#(and (not (= |main_#t~malloc0.base| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|)) (= 2 (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| 1))) (= 0 |main_#t~malloc0.offset|) (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|)), 2771#(and (not (= main_~p~0.base |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|)) (= 2 (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| 1))) (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 main_~p~0.offset)), 2772#(= |#memory_int| |old(#memory_int)|), 2773#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 2774#(or (and (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_size| 10)))) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 2775#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr9|) (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 2776#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 2 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)) (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)))) (<= 3 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))), 2777#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (<= 4 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))) (<= 3 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)))), 2778#(or (and (= (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|) 4) (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 5 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))), 2779#(or (and (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))) (<= 5 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 6 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))), 2780#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (<= 7 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))) (<= 6 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)))), 2781#(or (and (<= 7 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)) (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (<= 8 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 2782#(or (and (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))) (<= 8 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (<= 9 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 2783#(or (and (or (<= 10 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))) (not (= 1 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)))] [2018-04-11 14:23:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:23:57,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 14:23:57,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 14:23:57,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-04-11 14:23:57,429 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 22 states. [2018-04-11 14:23:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:58,257 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-04-11 14:23:58,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 14:23:58,257 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2018-04-11 14:23:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:58,258 INFO L225 Difference]: With dead ends: 75 [2018-04-11 14:23:58,258 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 14:23:58,258 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 14:23:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 14:23:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-04-11 14:23:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 14:23:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-04-11 14:23:58,260 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 44 [2018-04-11 14:23:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:58,260 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-04-11 14:23:58,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 14:23:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-04-11 14:23:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 14:23:58,261 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:58,261 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:58,261 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash -454034025, now seen corresponding path program 1 times [2018-04-11 14:23:58,261 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:58,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:23:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 14:23:58,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:23:58,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 14:23:58,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:23:58,962 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:23:58,962 INFO L182 omatonBuilderFactory]: Interpolants [2976#(and (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|)) (= 3 (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| 2)))), 2977#(and (= 0 |main_#t~malloc0.offset|) (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|) (not (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base| |main_#t~malloc0.base|)) (= 3 (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| 2)))), 2978#(and (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 main_~p~0.offset) (not (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base| main_~p~0.base)) (= 3 (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| 2)))), 2979#(= |#memory_int| |old(#memory_int)|), 2980#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2981#(or (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2))) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|) 2) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 4 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2982#(or (<= 5 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.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_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|) 3) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2983#(or (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.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_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 6 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|) 4)), 2984#(or (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2))) (<= 7 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|) 5) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2985#(or (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.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_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 8 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|) 6) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2986#(or (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2))) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|) 7) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 9 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2987#(or (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|) 8) (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 2) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 2))) (<= 10 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2988#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|) 9) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2) (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 2)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 2989#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 11 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 2) (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 2)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset|) 9)), 2990#(and (= 3 (select (select |#memory_int| main_~p~0.base) 2)) (= 0 main_~p~0.offset)), 2991#(= 3 |main_#t~mem4|), 2992#(= 1 (select |#valid| main_~p~0.base)), 2973#true, 2974#false, 2975#(and (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|)))] [2018-04-11 14:23:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 14:23:58,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 14:23:58,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 14:23:58,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-04-11 14:23:58,963 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 20 states. [2018-04-11 14:23:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:23:59,620 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-04-11 14:23:59,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 14:23:59,620 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-04-11 14:23:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:23:59,620 INFO L225 Difference]: With dead ends: 70 [2018-04-11 14:23:59,620 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 14:23:59,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2018-04-11 14:23:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 14:23:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-04-11 14:23:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 14:23:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-04-11 14:23:59,622 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 46 [2018-04-11 14:23:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:23:59,623 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-04-11 14:23:59,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 14:23:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-04-11 14:23:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 14:23:59,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:23:59,624 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:59,624 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:23:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash -407465533, now seen corresponding path program 1 times [2018-04-11 14:23:59,624 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:23:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:23:59,652 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:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:00,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:00,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 14:24:00,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:00,352 INFO L182 omatonBuilderFactory]: Interpolants [3168#(or (and (or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (<= 9 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|))) (<= 8 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3169#(or (and (not (= 3 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3))) (<= 10 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3170#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3171#(and (= 0 main_~p~0.offset) (= 4 (select (select |#memory_int| main_~p~0.base) 3))), 3172#(and (= |main_#t~mem5| 4) (= 0 main_~p~0.offset)), 3173#(= 1 (select |#valid| main_~p~0.base)), 3152#true, 3153#false, 3154#(and (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|))), 3155#(and (= 4 (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| 3))) (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|))), 3156#(and (not (= |main_#t~malloc0.base| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|)) (= 4 (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| 3))) (= 0 |main_#t~malloc0.offset|) (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|)), 3157#(and (not (= main_~p~0.base |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|)) (= 4 (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| 3))) (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 main_~p~0.offset)), 3158#(= |#memory_int| |old(#memory_int)|), 3159#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3160#(or (and (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3161#(or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 1 |#Ultimate.C_memcpy_#t~loopctr9|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3162#(or (not (= |#Ultimate.C_memcpy_size| 10)) (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|)) (<= 2 |#Ultimate.C_memcpy_#t~loopctr9|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3163#(or (not (= |#Ultimate.C_memcpy_size| 10)) (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|)) (<= 3 |#Ultimate.C_memcpy_#t~loopctr9|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3164#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (= (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|) 4) (< 4 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (or (<= 5 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3))) (not (= |#Ultimate.C_memcpy_src.offset| 0)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3165#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3))) (not (= |#Ultimate.C_memcpy_src.offset| 0))) (<= 5 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (<= 6 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))), 3166#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (and (or (<= 7 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3))) (not (= |#Ultimate.C_memcpy_src.offset| 0))) (<= 6 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)))), 3167#(or (and (<= 7 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)) (or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3))) (not (= |#Ultimate.C_memcpy_src.offset| 0)))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 8 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|))] [2018-04-11 14:24:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:00,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 14:24:00,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 14:24:00,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-11 14:24:00,353 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 22 states. [2018-04-11 14:24:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:01,075 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-04-11 14:24:01,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 14:24:01,076 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-04-11 14:24:01,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:01,076 INFO L225 Difference]: With dead ends: 65 [2018-04-11 14:24:01,076 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 14:24:01,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=1292, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 14:24:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 14:24:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-04-11 14:24:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-11 14:24:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-04-11 14:24:01,078 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 48 [2018-04-11 14:24:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:01,079 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-04-11 14:24:01,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 14:24:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-04-11 14:24:01,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 14:24:01,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:01,079 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,079 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:24:01,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1395182767, now seen corresponding path program 1 times [2018-04-11 14:24:01,080 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:01,119 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:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:01,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:01,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 14:24:01,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:01,948 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:01,948 INFO L182 omatonBuilderFactory]: Interpolants [3360#(= 1 (select |#valid| main_~p~0.base)), 3339#true, 3340#false, 3341#(and (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|))), 3342#(and (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|)) (= 0 (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| 4)))), 3343#(and (= 0 |main_#t~malloc0.offset|) (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|) (not (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base| |main_#t~malloc0.base|)) (= 0 (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| 4)))), 3344#(and (= 0 |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 main_~p~0.offset) (= 0 (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| 4))) (not (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base| main_~p~0.base))), 3345#(= |#memory_int| |old(#memory_int)|), 3346#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3347#(or (and (= |#Ultimate.C_memcpy_#t~loopctr9| 0) (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3348#(or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 1 |#Ultimate.C_memcpy_#t~loopctr9|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3349#(or (not (= |#Ultimate.C_memcpy_size| 10)) (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|)) (<= 2 |#Ultimate.C_memcpy_#t~loopctr9|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3350#(or (not (= |#Ultimate.C_memcpy_size| 10)) (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|)) (<= 3 |#Ultimate.C_memcpy_#t~loopctr9|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3351#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (= (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|) 4) (< 4 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3352#(or (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 4) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 4)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 4) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 4)) (<= 5 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 6 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3353#(or (<= 7 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 4) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 4)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 4) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 4)) (<= 6 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3354#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 4) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 4)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 4) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 4)) (<= 7 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 8 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3355#(or (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 4) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 4)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 4) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 4)) (<= 8 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 9 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3356#(or (<= 10 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr9|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 4) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 4)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 4) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 4)) (not (= 4 (+ |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_dest.offset|)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3357#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 4) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 4)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3358#(and (= 0 main_~p~0.offset) (= 0 (select (select |#memory_int| main_~p~0.base) 4))), 3359#(= |main_#t~mem6| 0)] [2018-04-11 14:24:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:24:01,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 14:24:01,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 14:24:01,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-11 14:24:01,949 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 22 states. [2018-04-11 14:24:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:02,724 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-04-11 14:24:02,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 14:24:02,724 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-04-11 14:24:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:02,725 INFO L225 Difference]: With dead ends: 60 [2018-04-11 14:24:02,725 INFO L226 Difference]: Without dead ends: 60 [2018-04-11 14:24:02,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=268, Invalid=1292, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 14:24:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-11 14:24:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-04-11 14:24:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-11 14:24:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-04-11 14:24:02,727 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 50 [2018-04-11 14:24:02,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:02,727 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-04-11 14:24:02,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 14:24:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-04-11 14:24:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 14:24:02,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:02,728 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,728 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:24:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1419877153, now seen corresponding path program 1 times [2018-04-11 14:24:02,729 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:02,744 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:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-04-11 14:24:02,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:24:02,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:24:02,791 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:02,791 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:02,791 INFO L182 omatonBuilderFactory]: Interpolants [3520#(= (store |#valid| main_~p~0.base 0) |old(#valid)|), 3516#true, 3517#false, 3518#(= |#valid| |old(#valid)|), 3519#(= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|)] [2018-04-11 14:24:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-04-11 14:24:02,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:24:02,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:24:02,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:24:02,792 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 5 states. [2018-04-11 14:24:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:02,847 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-04-11 14:24:02,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:24:02,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-04-11 14:24:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:02,847 INFO L225 Difference]: With dead ends: 59 [2018-04-11 14:24:02,848 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 14:24:02,848 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:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 14:24:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 14:24:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 14:24:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-04-11 14:24:02,849 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-04-11 14:24:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:02,850 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-04-11 14:24:02,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:24:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-04-11 14:24:02,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 14:24:02,850 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:24:02,850 INFO L355 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,850 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr6AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr7AssertViolationMEMORY_FREE, mainErr30EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr11AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 14:24:02,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1274557068, now seen corresponding path program 1 times [2018-04-11 14:24:02,851 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:24:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:24:02,890 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:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-11 14:24:03,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:24:03,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 14:24:03,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:24:03,327 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:03,327 INFO L182 omatonBuilderFactory]: Interpolants [3648#(or (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 3)))) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 3))))) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 3)))) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 3)))))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3649#(or (and (<= |#Ultimate.C_memcpy_#t~loopctr9| |#Ultimate.C_memcpy_size|) (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ (- |#Ultimate.C_memcpy_size|) 4)))) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_size|) 4))))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (<= (+ |#Ultimate.C_memcpy_#t~loopctr9| 1) |#Ultimate.C_memcpy_size|) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3650#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ (- |#Ultimate.C_memcpy_size|) 4)))) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_size|) 4))))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3651#(and (= 0 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 6))) (= 0 main_~p~0.offset)), 3652#(and (= 0 main_~p~0.offset) (= |main_#t~mem7| 0)), 3653#(= 1 (select |#valid| main_~p~0.base)), 3638#true, 3639#false, 3640#(and (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|))), 3641#(and (= 0 (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| 6))) (= |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.offset| 0) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields_____true_valid_memsafety_true_termination_i__d~0.base|))), 3642#(and (= 0 |main_#t~malloc0.offset|) (= 0 (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| 6))) (= |~#__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|))), 3643#(and (= 0 (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| 6))) (= 0 main_~p~0.offset) (= |~#__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_~p~0.base))), 3644#(= |#memory_int| |old(#memory_int)|), 3645#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3646#(or (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 1)))) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 1))))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 1)))) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 1)))))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 3647#(or (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 2)))) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 2))))) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 2)))) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ |#Ultimate.C_memcpy_src.offset| (- (+ (- |#Ultimate.C_memcpy_#t~loopctr9|) 2)))))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|))] [2018-04-11 14:24:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-11 14:24:03,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 14:24:03,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 14:24:03,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-11 14:24:03,328 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 16 states. [2018-04-11 14:24:03,837 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 81 DAG size of output 72 [2018-04-11 14:24:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:24:04,015 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-04-11 14:24:04,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 14:24:04,015 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-04-11 14:24:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:24:04,016 INFO L225 Difference]: With dead ends: 48 [2018-04-11 14:24:04,016 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 14:24:04,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2018-04-11 14:24:04,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 14:24:04,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 14:24:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 14:24:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 14:24:04,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2018-04-11 14:24:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:24:04,016 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 14:24:04,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 14:24:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 14:24:04,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 14:24:04,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 02:24:04 BoogieIcfgContainer [2018-04-11 14:24:04,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 14:24:04,022 INFO L168 Benchmark]: Toolchain (without parser) took 10923.78 ms. Allocated memory was 403.7 MB in the beginning and 835.2 MB in the end (delta: 431.5 MB). Free memory was 340.8 MB in the beginning and 409.6 MB in the end (delta: -68.8 MB). Peak memory consumption was 362.7 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:04,023 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 403.7 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 14:24:04,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.15 ms. Allocated memory is still 403.7 MB. Free memory was 340.8 MB in the beginning and 330.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:04,024 INFO L168 Benchmark]: Boogie Preprocessor took 28.23 ms. Allocated memory is still 403.7 MB. Free memory was 330.3 MB in the beginning and 327.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:04,024 INFO L168 Benchmark]: RCFGBuilder took 360.42 ms. Allocated memory was 403.7 MB in the beginning and 583.5 MB in the end (delta: 179.8 MB). Free memory was 327.6 MB in the beginning and 536.7 MB in the end (delta: -209.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:04,024 INFO L168 Benchmark]: TraceAbstraction took 10369.69 ms. Allocated memory was 583.5 MB in the beginning and 835.2 MB in the end (delta: 251.7 MB). Free memory was 536.7 MB in the beginning and 409.6 MB in the end (delta: 127.1 MB). Peak memory consumption was 378.8 MB. Max. memory is 5.3 GB. [2018-04-11 14:24:04,025 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.17 ms. Allocated memory is still 403.7 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.15 ms. Allocated memory is still 403.7 MB. Free memory was 340.8 MB in the beginning and 330.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.23 ms. Allocated memory is still 403.7 MB. Free memory was 330.3 MB in the beginning and 327.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 360.42 ms. Allocated memory was 403.7 MB in the beginning and 583.5 MB in the end (delta: 179.8 MB). Free memory was 327.6 MB in the beginning and 536.7 MB in the end (delta: -209.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10369.69 ms. Allocated memory was 583.5 MB in the beginning and 835.2 MB in the end (delta: 251.7 MB). Free memory was 536.7 MB in the beginning and 409.6 MB in the end (delta: 127.1 MB). Peak memory consumption was 378.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 60]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 49]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 46]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 54]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 37]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 51]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 51]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 45]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 46]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 55]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 54]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 60]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 45]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 49]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 58]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 31 error locations. SAFE Result, 10.3s OverallTime, 21 OverallIterations, 10 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1062 SDtfs, 1354 SDslu, 4509 SDs, 0 SdLazy, 3421 SolverSat, 361 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 90 SyntacticMatches, 19 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 153/550 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, 21 MinimizatonAttempts, 87 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 780 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 759 ConstructedInterpolants, 0 QuantifiedInterpolants, 275874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 153/550 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3.1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_14-24-04-042.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3.1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_14-24-04-042.csv Received shutdown request...