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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 01:01:42,140 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 01:01:42,142 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 01:01:42,154 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 01:01:42,155 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 01:01:42,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 01:01:42,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 01:01:42,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 01:01:42,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 01:01:42,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 01:01:42,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 01:01:42,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 01:01:42,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 01:01:42,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 01:01:42,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 01:01:42,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 01:01:42,166 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 01:01:42,167 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 01:01:42,168 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 01:01:42,169 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 01:01:42,170 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 01:01:42,171 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 01:01:42,171 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 01:01:42,172 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 01:01:42,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 01:01:42,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 01:01:42,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 01:01:42,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 01:01:42,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 01:01:42,174 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 01:01:42,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 01:01:42,175 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-13 01:01:42,185 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 01:01:42,185 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 01:01:42,186 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 01:01:42,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 01:01:42,186 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 01:01:42,186 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 01:01:42,186 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 01:01:42,186 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 01:01:42,186 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 01:01:42,187 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 01:01:42,187 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 01:01:42,187 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 01:01:42,187 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 01:01:42,187 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 01:01:42,187 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 01:01:42,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 01:01:42,188 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 01:01:42,188 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 01:01:42,188 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 01:01:42,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 01:01:42,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 01:01:42,188 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 01:01:42,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 01:01:42,225 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 01:01:42,228 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 01:01:42,229 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 01:01:42,229 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 01:01:42,230 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_true-valid-memsafety_true-termination.i [2018-04-13 01:01:42,549 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc432d72d1 [2018-04-13 01:01:42,636 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 01:01:42,637 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 01:01:42,637 INFO L168 CDTParser]: Scanning test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-13 01:01:42,638 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 01:01:42,638 INFO L215 ultiparseSymbolTable]: [2018-04-13 01:01:42,638 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 01:01:42,638 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-13 01:01:42,638 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 01:01:42,638 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-13 01:01:42,638 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-13 01:01:42,653 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc432d72d1 [2018-04-13 01:01:42,656 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 01:01:42,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 01:01:42,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 01:01:42,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 01:01:42,661 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 01:01:42,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 01:01:42" (1/1) ... [2018-04-13 01:01:42,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b612d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:42, skipping insertion in model container [2018-04-13 01:01:42,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 01:01:42" (1/1) ... [2018-04-13 01:01:42,675 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 01:01:42,685 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 01:01:42,782 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 01:01:42,807 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 01:01:42,812 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-13 01:01:42,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:42 WrapperNode [2018-04-13 01:01:42,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 01:01:42,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 01:01:42,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 01:01:42,822 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 01:01:42,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:42" (1/1) ... [2018-04-13 01:01:42,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:42" (1/1) ... [2018-04-13 01:01:42,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:42" (1/1) ... [2018-04-13 01:01:42,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:42" (1/1) ... [2018-04-13 01:01:42,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:42" (1/1) ... [2018-04-13 01:01:42,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:42" (1/1) ... [2018-04-13 01:01:42,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:42" (1/1) ... [2018-04-13 01:01:42,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 01:01:42,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 01:01:42,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 01:01:42,853 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 01:01:42,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:42" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 01:01:42,887 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 01:01:42,887 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 01:01:42,888 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 01:01:42,888 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 01:01:42,888 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 01:01:43,207 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-13 01:01:43,225 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 01:01:43,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 01:01:43 BoogieIcfgContainer [2018-04-13 01:01:43,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 01:01:43,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 01:01:43,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 01:01:43,228 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 01:01:43,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 01:01:42" (1/3) ... [2018-04-13 01:01:43,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1d26c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 01:01:43, skipping insertion in model container [2018-04-13 01:01:43,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:01:42" (2/3) ... [2018-04-13 01:01:43,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1d26c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 01:01:43, skipping insertion in model container [2018-04-13 01:01:43,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 01:01:43" (3/3) ... [2018-04-13 01:01:43,231 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-13 01:01:43,236 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-13 01:01:43,242 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-13 01:01:43,265 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 01:01:43,266 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 01:01:43,266 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 01:01:43,266 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-13 01:01:43,266 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-13 01:01:43,266 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 01:01:43,266 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 01:01:43,266 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 01:01:43,266 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 01:01:43,267 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 01:01:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-04-13 01:01:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 01:01:43,283 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:43,283 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:43,284 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:43,286 INFO L82 PathProgramCache]: Analyzing trace with hash -383275974, now seen corresponding path program 1 times [2018-04-13 01:01:43,317 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:43,354 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:43,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:01:43,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 01:01:43,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:43,407 INFO L182 omatonBuilderFactory]: Interpolants [130#true, 131#false, 132#(= 1 (select |#valid| |main_#t~malloc0.base|)), 133#(= 1 (select |#valid| main_~p~0.base))] [2018-04-13 01:01:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:43,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:01:43,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:01:43,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:01:43,417 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 4 states. [2018-04-13 01:01:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:43,662 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-04-13 01:01:43,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 01:01:43,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-13 01:01:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:43,676 INFO L225 Difference]: With dead ends: 202 [2018-04-13 01:01:43,676 INFO L226 Difference]: Without dead ends: 199 [2018-04-13 01:01:43,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:01:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-13 01:01:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2018-04-13 01:01:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-13 01:01:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-04-13 01:01:43,715 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 17 [2018-04-13 01:01:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:43,716 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-04-13 01:01:43,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:01:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-04-13 01:01:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 01:01:43,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:43,717 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:43,718 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:43,718 INFO L82 PathProgramCache]: Analyzing trace with hash -383275973, now seen corresponding path program 1 times [2018-04-13 01:01:43,719 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:43,735 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:43,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:01:43,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 01:01:43,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:43,770 INFO L182 omatonBuilderFactory]: Interpolants [461#true, 462#false, 463#(= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|))] [2018-04-13 01:01:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:43,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 01:01:43,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 01:01:43,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 01:01:43,772 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 3 states. [2018-04-13 01:01:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:43,851 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-04-13 01:01:43,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 01:01:43,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-13 01:01:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:43,853 INFO L225 Difference]: With dead ends: 188 [2018-04-13 01:01:43,853 INFO L226 Difference]: Without dead ends: 188 [2018-04-13 01:01:43,853 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 01:01:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-13 01:01:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 122. [2018-04-13 01:01:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-13 01:01:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-04-13 01:01:43,859 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 17 [2018-04-13 01:01:43,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:43,859 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-04-13 01:01:43,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 01:01:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-04-13 01:01:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 01:01:43,860 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:43,860 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:43,860 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:43,860 INFO L82 PathProgramCache]: Analyzing trace with hash -383275972, now seen corresponding path program 1 times [2018-04-13 01:01:43,861 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:43,877 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:43,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:01:43,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 01:01:43,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:43,911 INFO L182 omatonBuilderFactory]: Interpolants [774#true, 775#false, 776#(and (= 0 |main_#t~malloc0.offset|) (= 10 (select |#length| |main_#t~malloc0.base|))), 777#(and (= 10 (select |#length| main_~p~0.base)) (= main_~p~0.offset 0))] [2018-04-13 01:01:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:43,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:01:43,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:01:43,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:01:43,912 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 4 states. [2018-04-13 01:01:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:43,979 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-13 01:01:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 01:01:43,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-13 01:01:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:43,980 INFO L225 Difference]: With dead ends: 100 [2018-04-13 01:01:43,981 INFO L226 Difference]: Without dead ends: 100 [2018-04-13 01:01:43,981 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:01:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-13 01:01:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-13 01:01:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-13 01:01:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-13 01:01:43,985 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 17 [2018-04-13 01:01:43,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:43,986 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-13 01:01:43,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:01:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-13 01:01:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 01:01:43,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:43,987 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:43,987 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash -383275971, now seen corresponding path program 1 times [2018-04-13 01:01:43,988 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:43,997 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:01:44,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 01:01:44,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:44,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-13 01:01:44,031 INFO L182 omatonBuilderFactory]: Interpolants [980#true, 981#false, 982#(and (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset| 0) (= 10 (select |#length| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)))] [2018-04-13 01:01:44,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-13 01:01:44,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 01:01:44,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 01:01:44,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 01:01:44,031 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 3 states. [2018-04-13 01:01:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:44,047 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-04-13 01:01:44,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 01:01:44,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-13 01:01:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:44,048 INFO L225 Difference]: With dead ends: 99 [2018-04-13 01:01:44,048 INFO L226 Difference]: Without dead ends: 99 [2018-04-13 01:01:44,048 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 01:01:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-13 01:01:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-04-13 01:01:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-13 01:01:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-04-13 01:01:44,053 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 17 [2018-04-13 01:01:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:44,054 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-04-13 01:01:44,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 01:01:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-04-13 01:01:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 01:01:44,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:44,055 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:44,055 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1560963691, now seen corresponding path program 1 times [2018-04-13 01:01:44,056 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:44,068 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:01:44,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 01:01:44,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,094 INFO L182 omatonBuilderFactory]: Interpolants [1184#(not (= |#Ultimate.C_memcpy_size| 10)), 1181#true, 1182#false, 1183#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10)))] [2018-04-13 01:01:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:01:44,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:01:44,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:01:44,094 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2018-04-13 01:01:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:44,102 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-04-13 01:01:44,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 01:01:44,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-13 01:01:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:44,104 INFO L225 Difference]: With dead ends: 102 [2018-04-13 01:01:44,104 INFO L226 Difference]: Without dead ends: 100 [2018-04-13 01:01:44,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:01:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-13 01:01:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-13 01:01:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-13 01:01:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-13 01:01:44,108 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 29 [2018-04-13 01:01:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:44,109 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-13 01:01:44,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:01:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-13 01:01:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 01:01:44,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:44,110 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] [2018-04-13 01:01:44,110 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash 730350873, now seen corresponding path program 1 times [2018-04-13 01:01:44,111 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:44,124 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:44,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-13 01:01:44,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,156 INFO L182 omatonBuilderFactory]: Interpolants [1387#true, 1388#false, 1389#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1390#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 1391#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-13 01:01:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:01:44,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:01:44,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:01:44,157 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 5 states. [2018-04-13 01:01:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:44,184 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-04-13 01:01:44,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 01:01:44,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-13 01:01:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:44,188 INFO L225 Difference]: With dead ends: 103 [2018-04-13 01:01:44,188 INFO L226 Difference]: Without dead ends: 101 [2018-04-13 01:01:44,188 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:01:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-13 01:01:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-04-13 01:01:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-13 01:01:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-04-13 01:01:44,192 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 30 [2018-04-13 01:01:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:44,192 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-04-13 01:01:44,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:01:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-04-13 01:01:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 01:01:44,193 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:44,193 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] [2018-04-13 01:01:44,193 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:44,194 INFO L82 PathProgramCache]: Analyzing trace with hash 751157291, now seen corresponding path program 2 times [2018-04-13 01:01:44,195 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:44,209 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:44,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-13 01:01:44,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,249 INFO L182 omatonBuilderFactory]: Interpolants [1600#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 1601#(not (= |#Ultimate.C_memcpy_size| 10)), 1596#true, 1597#false, 1598#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1599#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10)))] [2018-04-13 01:01:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 01:01:44,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 01:01:44,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-13 01:01:44,250 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 6 states. [2018-04-13 01:01:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:44,291 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-04-13 01:01:44,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 01:01:44,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-13 01:01:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:44,296 INFO L225 Difference]: With dead ends: 104 [2018-04-13 01:01:44,296 INFO L226 Difference]: Without dead ends: 102 [2018-04-13 01:01:44,296 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-13 01:01:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-13 01:01:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-04-13 01:01:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-13 01:01:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-04-13 01:01:44,299 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 31 [2018-04-13 01:01:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:44,300 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-04-13 01:01:44,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 01:01:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-04-13 01:01:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 01:01:44,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:44,301 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] [2018-04-13 01:01:44,301 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1396156249, now seen corresponding path program 3 times [2018-04-13 01:01:44,302 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:44,314 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:44,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-13 01:01:44,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,362 INFO L182 omatonBuilderFactory]: Interpolants [1808#true, 1809#false, 1810#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 1811#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 1812#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 1813#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 1814#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-13 01:01:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 01:01:44,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 01:01:44,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-13 01:01:44,363 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2018-04-13 01:01:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:44,381 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-04-13 01:01:44,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 01:01:44,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-04-13 01:01:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:44,382 INFO L225 Difference]: With dead ends: 105 [2018-04-13 01:01:44,382 INFO L226 Difference]: Without dead ends: 103 [2018-04-13 01:01:44,382 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-13 01:01:44,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-13 01:01:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-04-13 01:01:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-13 01:01:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-04-13 01:01:44,385 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 32 [2018-04-13 01:01:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:44,385 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-04-13 01:01:44,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 01:01:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-04-13 01:01:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 01:01:44,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:44,386 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] [2018-04-13 01:01:44,386 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash -83712533, now seen corresponding path program 4 times [2018-04-13 01:01:44,387 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:44,400 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:44,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 01:01:44,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,457 INFO L182 omatonBuilderFactory]: Interpolants [2023#true, 2024#false, 2025#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2026#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 2027#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 2028#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 2029#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2030#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-13 01:01:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 01:01:44,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 01:01:44,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-13 01:01:44,458 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 8 states. [2018-04-13 01:01:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:44,479 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-04-13 01:01:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 01:01:44,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-13 01:01:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:44,480 INFO L225 Difference]: With dead ends: 106 [2018-04-13 01:01:44,480 INFO L226 Difference]: Without dead ends: 104 [2018-04-13 01:01:44,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-13 01:01:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-13 01:01:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-13 01:01:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-13 01:01:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-04-13 01:01:44,484 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 33 [2018-04-13 01:01:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:44,484 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-04-13 01:01:44,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 01:01:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-04-13 01:01:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 01:01:44,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:44,485 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] [2018-04-13 01:01:44,485 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:44,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1284995481, now seen corresponding path program 5 times [2018-04-13 01:01:44,486 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:44,499 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:44,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 01:01:44,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,561 INFO L182 omatonBuilderFactory]: Interpolants [2241#true, 2242#false, 2243#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2244#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 2245#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 2246#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 2247#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2248#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 2249#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-13 01:01:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 01:01:44,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 01:01:44,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-13 01:01:44,562 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 9 states. [2018-04-13 01:01:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:44,582 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-04-13 01:01:44,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 01:01:44,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-13 01:01:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:44,583 INFO L225 Difference]: With dead ends: 107 [2018-04-13 01:01:44,583 INFO L226 Difference]: Without dead ends: 105 [2018-04-13 01:01:44,583 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-13 01:01:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-13 01:01:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-04-13 01:01:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-13 01:01:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-04-13 01:01:44,585 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 34 [2018-04-13 01:01:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:44,585 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-04-13 01:01:44,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 01:01:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-04-13 01:01:44,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 01:01:44,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:44,585 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] [2018-04-13 01:01:44,585 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:44,586 INFO L82 PathProgramCache]: Analyzing trace with hash 765270955, now seen corresponding path program 6 times [2018-04-13 01:01:44,586 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:44,596 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:44,663 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-13 01:01:44,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:44,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 01:01:44,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,664 INFO L182 omatonBuilderFactory]: Interpolants [2464#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2465#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 2466#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 2467#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 2468#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2469#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 2470#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 6) (not (= |#Ultimate.C_memcpy_size| 10))), 2471#(not (= |#Ultimate.C_memcpy_size| 10)), 2462#true, 2463#false] [2018-04-13 01:01:44,664 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-13 01:01:44,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 01:01:44,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 01:01:44,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-13 01:01:44,665 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 10 states. [2018-04-13 01:01:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:44,682 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-04-13 01:01:44,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 01:01:44,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-04-13 01:01:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:44,683 INFO L225 Difference]: With dead ends: 108 [2018-04-13 01:01:44,683 INFO L226 Difference]: Without dead ends: 106 [2018-04-13 01:01:44,683 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-13 01:01:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-13 01:01:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-04-13 01:01:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-13 01:01:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-04-13 01:01:44,685 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 35 [2018-04-13 01:01:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:44,685 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-04-13 01:01:44,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 01:01:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-04-13 01:01:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 01:01:44,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:44,685 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] [2018-04-13 01:01:44,685 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1833679833, now seen corresponding path program 7 times [2018-04-13 01:01:44,686 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:44,699 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:44,770 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-13 01:01:44,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:44,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 01:01:44,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,770 INFO L182 omatonBuilderFactory]: Interpolants [2688#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2689#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 2690#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 2691#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 2692#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2693#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 2694#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 6) (not (= |#Ultimate.C_memcpy_size| 10))), 2695#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 7)), 2696#(not (= |#Ultimate.C_memcpy_size| 10)), 2686#true, 2687#false] [2018-04-13 01:01:44,771 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-13 01:01:44,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 01:01:44,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 01:01:44,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-13 01:01:44,771 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 11 states. [2018-04-13 01:01:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:44,790 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-04-13 01:01:44,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 01:01:44,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-04-13 01:01:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:44,795 INFO L225 Difference]: With dead ends: 109 [2018-04-13 01:01:44,795 INFO L226 Difference]: Without dead ends: 107 [2018-04-13 01:01:44,796 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-13 01:01:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-13 01:01:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-04-13 01:01:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-13 01:01:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-04-13 01:01:44,798 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 36 [2018-04-13 01:01:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:44,799 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-04-13 01:01:44,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 01:01:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-04-13 01:01:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 01:01:44,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:44,799 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] [2018-04-13 01:01:44,800 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:44,800 INFO L82 PathProgramCache]: Analyzing trace with hash 594616683, now seen corresponding path program 8 times [2018-04-13 01:01:44,800 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:44,815 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:44,889 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-13 01:01:44,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:44,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 01:01:44,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:44,890 INFO L182 omatonBuilderFactory]: Interpolants [2913#true, 2914#false, 2915#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 2916#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 2917#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 2918#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 2919#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 2920#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 2921#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 6) (not (= |#Ultimate.C_memcpy_size| 10))), 2922#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 7)), 2923#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 8)), 2924#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-13 01:01:44,890 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-13 01:01:44,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 01:01:44,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 01:01:44,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-13 01:01:44,891 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 12 states. [2018-04-13 01:01:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:44,917 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-04-13 01:01:44,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 01:01:44,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-04-13 01:01:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:44,918 INFO L225 Difference]: With dead ends: 110 [2018-04-13 01:01:44,918 INFO L226 Difference]: Without dead ends: 108 [2018-04-13 01:01:44,919 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-13 01:01:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-13 01:01:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-13 01:01:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-13 01:01:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2018-04-13 01:01:44,921 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2018-04-13 01:01:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:44,921 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2018-04-13 01:01:44,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 01:01:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-04-13 01:01:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 01:01:44,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:44,922 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] [2018-04-13 01:01:44,922 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:44,922 INFO L82 PathProgramCache]: Analyzing trace with hash 838364697, now seen corresponding path program 9 times [2018-04-13 01:01:44,923 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:44,937 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:45,023 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-13 01:01:45,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:45,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 01:01:45,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:45,024 INFO L182 omatonBuilderFactory]: Interpolants [3143#true, 3144#false, 3145#(or (= |#Ultimate.C_memcpy_#t~loopctr13| 0) (not (= |#Ultimate.C_memcpy_size| 10))), 3146#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 1) (not (= |#Ultimate.C_memcpy_size| 10))), 3147#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 2)), 3148#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 3)), 3149#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 4) (not (= |#Ultimate.C_memcpy_size| 10))), 3150#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 5) (not (= |#Ultimate.C_memcpy_size| 10))), 3151#(or (<= |#Ultimate.C_memcpy_#t~loopctr13| 6) (not (= |#Ultimate.C_memcpy_size| 10))), 3152#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 7)), 3153#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 8)), 3154#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= |#Ultimate.C_memcpy_#t~loopctr13| 9)), 3155#(not (= |#Ultimate.C_memcpy_size| 10))] [2018-04-13 01:01:45,024 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-13 01:01:45,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 01:01:45,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 01:01:45,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-13 01:01:45,025 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 13 states. [2018-04-13 01:01:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:45,038 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-04-13 01:01:45,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 01:01:45,038 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-04-13 01:01:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:45,039 INFO L225 Difference]: With dead ends: 111 [2018-04-13 01:01:45,039 INFO L226 Difference]: Without dead ends: 109 [2018-04-13 01:01:45,039 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-13 01:01:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-13 01:01:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-04-13 01:01:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-13 01:01:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2018-04-13 01:01:45,041 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 38 [2018-04-13 01:01:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:45,041 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2018-04-13 01:01:45,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 01:01:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2018-04-13 01:01:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 01:01:45,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:45,042 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] [2018-04-13 01:01:45,042 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:45,042 INFO L82 PathProgramCache]: Analyzing trace with hash -195381461, now seen corresponding path program 10 times [2018-04-13 01:01:45,043 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:45,101 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:45,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:45,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 01:01:45,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:45,573 INFO L182 omatonBuilderFactory]: Interpolants [3392#(or (<= 10 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (= (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)) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 8) (<= 10 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 8)), 3393#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 9) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 3394#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 11 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|)) (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset|) 9)), 3395#(= 0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 3396#(= |main_#t~mem2| 0), 3397#(= 1 (select |#valid| main_~p~0.base)), 3376#true, 3377#false, 3378#(= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|), 3379#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~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|))), 3380#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~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|)) (= |main_#t~malloc0.offset| 0)), 3381#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~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|)) (= 0 main_~p~0.offset)), 3382#(= |#memory_int| |old(#memory_int)|), 3383#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#memory_int| |old(#memory_int)|)), 3384#(or (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 0) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 2 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 0) (<= 2 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|))), 3385#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 1) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 3 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|))), 3386#(or (<= 4 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (= (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)) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 2)), 3387#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 3) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 5 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))), 3388#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 4) (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~loopctr13|))), 3389#(or (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 5) (= (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)) (<= 7 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))), 3390#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 0) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 0)) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 6) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 8 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))), 3391#(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)) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 7) (<= 9 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|)))] [2018-04-13 01:01:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:45,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 01:01:45,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 01:01:45,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-04-13 01:01:45,574 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 22 states. [2018-04-13 01:01:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:46,760 INFO L93 Difference]: Finished difference Result 186 states and 205 transitions. [2018-04-13 01:01:46,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 01:01:46,761 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2018-04-13 01:01:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:46,761 INFO L225 Difference]: With dead ends: 186 [2018-04-13 01:01:46,761 INFO L226 Difference]: Without dead ends: 186 [2018-04-13 01:01:46,762 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=310, Invalid=1496, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 01:01:46,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-13 01:01:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 115. [2018-04-13 01:01:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-13 01:01:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2018-04-13 01:01:46,765 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 39 [2018-04-13 01:01:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:46,765 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-04-13 01:01:46,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 01:01:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2018-04-13 01:01:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 01:01:46,766 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:46,766 INFO L355 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:01:46,766 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:46,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2118226009, now seen corresponding path program 11 times [2018-04-13 01:01:46,766 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:46,775 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:46,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:46,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 01:01:46,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:46,889 INFO L182 omatonBuilderFactory]: Interpolants [3744#(or (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (not (= |#Ultimate.C_memcpy_size| 10))), 3745#(or (<= 2 |#Ultimate.C_memcpy_#t~loopctr13|) (not (= |#Ultimate.C_memcpy_size| 10))), 3746#(or (<= 3 |#Ultimate.C_memcpy_#t~loopctr13|) (not (= |#Ultimate.C_memcpy_size| 10))), 3747#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= 4 |#Ultimate.C_memcpy_#t~loopctr13|)), 3748#(or (<= 5 |#Ultimate.C_memcpy_#t~loopctr13|) (not (= |#Ultimate.C_memcpy_size| 10))), 3749#(or (<= 6 |#Ultimate.C_memcpy_#t~loopctr13|) (not (= |#Ultimate.C_memcpy_size| 10))), 3750#(or (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|) (not (= |#Ultimate.C_memcpy_size| 10))), 3751#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|)), 3752#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= 9 |#Ultimate.C_memcpy_#t~loopctr13|)), 3753#(or (not (= |#Ultimate.C_memcpy_size| 10)) (<= 10 |#Ultimate.C_memcpy_#t~loopctr13|)), 3754#(not (= |#Ultimate.C_memcpy_size| 10)), 3741#true, 3742#false, 3743#(= |#Ultimate.C_memcpy_#t~loopctr13| 0)] [2018-04-13 01:01:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:46,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 01:01:46,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 01:01:46,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-04-13 01:01:46,890 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 14 states. [2018-04-13 01:01:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:46,919 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2018-04-13 01:01:46,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 01:01:46,919 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-04-13 01:01:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:46,920 INFO L225 Difference]: With dead ends: 107 [2018-04-13 01:01:46,920 INFO L226 Difference]: Without dead ends: 104 [2018-04-13 01:01:46,920 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-04-13 01:01:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-13 01:01:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-13 01:01:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-13 01:01:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-04-13 01:01:46,922 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 40 [2018-04-13 01:01:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:46,923 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-04-13 01:01:46,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 01:01:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-04-13 01:01:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 01:01:46,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:46,924 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] [2018-04-13 01:01:46,924 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:46,924 INFO L82 PathProgramCache]: Analyzing trace with hash -950455689, now seen corresponding path program 1 times [2018-04-13 01:01:46,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:46,959 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:47,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:47,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 01:01:47,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:47,442 INFO L182 omatonBuilderFactory]: Interpolants [3968#(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|))), 3969#(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| 1)))), 3970#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (not (= |main_#t~malloc0.base| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)) (= 0 |main_#t~malloc0.offset|) (= 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| 1)))), 3971#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 main_~p~0.offset) (= 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| 1))) (not (= main_~p~0.base |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|))), 3972#(= |#memory_int| |old(#memory_int)|), 3973#(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))), 3974#(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_dest.base| |#Ultimate.C_memcpy_src.base|)), 3975#(or (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 1) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 10)) (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)) (<= 3 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|))), 3976#(or (<= 4 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (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|) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 2) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))), 3977#(or (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 3) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 3) (<= 5 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (<= 5 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))), 3978#(or (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 4) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (<= 6 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))), 3979#(or (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 5) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (<= 7 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))), 3980#(or (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 6) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 6) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 10)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (<= 8 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (= (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_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|))), 3981#(or (<= 9 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 7) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 7) (<= 9 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1))), 3982#(or (<= 10 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 10)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (<= (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 8) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)) (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 8) (<= 10 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))), 3983#(or (<= (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 9) (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))), 3984#(or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|) (<= 11 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_size|)) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 1) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 1)) (<= (+ |#Ultimate.C_memcpy_size| |#Ultimate.C_memcpy_dest.offset|) 9)), 3985#(and (= 0 main_~p~0.offset) (= 3 (select (select |#memory_int| main_~p~0.base) 1))), 3986#(and (= |main_#t~mem3| 3) (= 0 main_~p~0.offset)), 3987#(= 1 (select |#valid| main_~p~0.base)), 3966#true, 3967#false] [2018-04-13 01:01:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:47,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 01:01:47,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 01:01:47,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-04-13 01:01:47,443 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 22 states. [2018-04-13 01:01:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:48,150 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-04-13 01:01:48,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 01:01:48,151 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-04-13 01:01:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:48,151 INFO L225 Difference]: With dead ends: 100 [2018-04-13 01:01:48,151 INFO L226 Difference]: Without dead ends: 100 [2018-04-13 01:01:48,152 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2018-04-13 01:01:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-13 01:01:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-04-13 01:01:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-13 01:01:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-04-13 01:01:48,154 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 41 [2018-04-13 01:01:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:48,155 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-04-13 01:01:48,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 01:01:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-04-13 01:01:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 01:01:48,156 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:48,156 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] [2018-04-13 01:01:48,156 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:48,156 INFO L82 PathProgramCache]: Analyzing trace with hash -727315325, now seen corresponding path program 1 times [2018-04-13 01:01:48,157 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:48,217 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:48,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:48,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 01:01:48,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:48,988 INFO L182 omatonBuilderFactory]: Interpolants [4224#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (<= 10 |#Ultimate.C_memcpy_#t~loopctr13|) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (<= 9 |#Ultimate.C_memcpy_#t~loopctr13|))), 4225#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#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)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4226#(and (= 0 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 2))) (= 0 main_~p~0.offset)), 4227#(and (= |main_#t~mem4| 0) (= 0 main_~p~0.offset)), 4228#(= 1 (select |#valid| main_~p~0.base)), 4207#true, 4208#false, 4209#(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|))), 4210#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~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| 2))) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|))), 4211#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 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| 2))) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |main_#t~malloc0.base|))), 4212#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~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| 2))) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset)), 4213#(= |#memory_int| |old(#memory_int)|), 4214#(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|)), 4215#(or (and (or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (= |#Ultimate.C_memcpy_#t~loopctr13| 0)) (not (= |#Ultimate.C_memcpy_size| 10))), 4216#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (or (= (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|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 4217#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr13|) (or (= (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|)))), 4218#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 4 |#Ultimate.C_memcpy_#t~loopctr13|) (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr13|) (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)))), 4219#(or (and (or (<= 5 |#Ultimate.C_memcpy_#t~loopctr13|) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (<= 4 |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 4220#(or (and (<= 5 |#Ultimate.C_memcpy_#t~loopctr13|) (or (<= 6 |#Ultimate.C_memcpy_#t~loopctr13|) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0))), 4221#(or (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 6 |#Ultimate.C_memcpy_#t~loopctr13|) (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|)))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)))), 4222#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (not (= |#Ultimate.C_memcpy_src.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|)))) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)) (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|))), 4223#(or (and (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 2)) |#Ultimate.C_memcpy_dest.offset|))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (<= 9 |#Ultimate.C_memcpy_#t~loopctr13|)) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)))] [2018-04-13 01:01:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:48,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 01:01:48,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 01:01:48,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-04-13 01:01:48,989 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 22 states. [2018-04-13 01:01:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:49,830 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-04-13 01:01:49,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 01:01:49,830 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-04-13 01:01:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:49,830 INFO L225 Difference]: With dead ends: 95 [2018-04-13 01:01:49,831 INFO L226 Difference]: Without dead ends: 95 [2018-04-13 01:01:49,831 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 01:01:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-13 01:01:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-04-13 01:01:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-13 01:01:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-04-13 01:01:49,833 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 43 [2018-04-13 01:01:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:49,834 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-04-13 01:01:49,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 01:01:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-04-13 01:01:49,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 01:01:49,834 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:49,834 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] [2018-04-13 01:01:49,834 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:49,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1037789873, now seen corresponding path program 1 times [2018-04-13 01:01:49,835 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:49,884 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:50,359 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-13 01:01:50,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:50,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 01:01:50,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:50,394 INFO L182 omatonBuilderFactory]: Interpolants [4454#true, 4455#false, 4456#(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|))), 4457#(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| 3)))), 4458#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (not (= |main_#t~malloc0.base| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|)) (= 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| 3)))), 4459#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 0 main_~p~0.offset) (not (= main_~p~0.base |~#__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| 3)))), 4460#(= |#memory_int| |old(#memory_int)|), 4461#(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|)), 4462#(or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (= |#Ultimate.C_memcpy_#t~loopctr13| 0)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4463#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (= (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|)), 4464#(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 (<= 2 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)))), 4465#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr13|) (= (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|)), 4466#(or (<= 5 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3)) (<= 4 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4467#(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)) (<= 5 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (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~loopctr13|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4468#(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)) (<= 6 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 7 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4469#(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)) (<= 7 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (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|) (<= 8 (+ |#Ultimate.C_memcpy_src.offset| |#Ultimate.C_memcpy_#t~loopctr13|))), 4470#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) 3) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) 3)) (<= 8 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|))) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (<= 9 |#Ultimate.C_memcpy_#t~loopctr13|)), 4471#(or (and (= (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_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|) 3))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 10 (+ |#Ultimate.C_memcpy_dest.offset| |#Ultimate.C_memcpy_#t~loopctr13|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4472#(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|)), 4473#(and (= 0 main_~p~0.offset) (= 0 (select (select |#memory_int| main_~p~0.base) 3))), 4474#(= |main_#t~mem5| 0), 4475#(= 1 (select |#valid| main_~p~0.base))] [2018-04-13 01:01:50,394 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-13 01:01:50,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 01:01:50,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 01:01:50,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-13 01:01:50,394 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 22 states. [2018-04-13 01:01:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:51,056 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-04-13 01:01:51,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 01:01:51,056 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-04-13 01:01:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:51,057 INFO L225 Difference]: With dead ends: 90 [2018-04-13 01:01:51,057 INFO L226 Difference]: Without dead ends: 90 [2018-04-13 01:01:51,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=1292, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 01:01:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-13 01:01:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-04-13 01:01:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-13 01:01:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2018-04-13 01:01:51,059 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 45 [2018-04-13 01:01:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:51,059 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-04-13 01:01:51,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 01:01:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2018-04-13 01:01:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-13 01:01:51,059 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:51,060 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] [2018-04-13 01:01:51,060 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:51,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1243880667, now seen corresponding path program 1 times [2018-04-13 01:01:51,060 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:51,084 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:51,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:51,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 01:01:51,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:51,598 INFO L182 omatonBuilderFactory]: Interpolants [4704#(or (<= 6 |#Ultimate.C_memcpy_#t~loopctr13|) (and (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr13|) 1)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_dest.offset|))) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr13|) 1)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr13|) 1)) |#Ultimate.C_memcpy_src.offset|))) (<= 5 |#Ultimate.C_memcpy_#t~loopctr13|)) (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|)), 4705#(or (and (<= 6 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr13|) 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr13|) 2)) |#Ultimate.C_memcpy_src.offset|))) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr13|) 2)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_dest.offset|)))) (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|) (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|)), 4706#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (and (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr13|) 3)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr13|) 3)) |#Ultimate.C_memcpy_src.offset|))) (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr13|) 3)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_dest.offset|))))), 4707#(or (and (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr13|) 4)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_dest.offset|))) (<= 9 |#Ultimate.C_memcpy_#t~loopctr13|)) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|)) (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|)), 4708#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_#t~loopctr13|) 5)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#Ultimate.C_memcpy_dest.offset|))) (<= 10 |#Ultimate.C_memcpy_#t~loopctr13|)) (<= 9 |#Ultimate.C_memcpy_#t~loopctr13|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4709#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- |#Ultimate.C_memcpy_size|) 6)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 4)) |#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)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4710#(and (= 0 main_~p~0.offset) (= 0 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 4)))), 4711#(and (= 0 main_~p~0.offset) (= |main_#t~mem6| 0)), 4712#(= 1 (select |#valid| main_~p~0.base)), 4691#true, 4692#false, 4693#(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|))), 4694#(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)))), 4695#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.offset|) (= 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| 4))) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |main_#t~malloc0.base|))), 4696#(and (= 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_~p~0.base)) (= 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)))), 4697#(= |#memory_int| |old(#memory_int)|), 4698#(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|)), 4699#(or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (= |#Ultimate.C_memcpy_#t~loopctr13| 0)) (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|)), 4700#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (= (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|)), 4701#(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.base| |#Ultimate.C_memcpy_dest.base|) (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)))), 4702#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr13|) (= (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|)), 4703#(or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 4 |#Ultimate.C_memcpy_#t~loopctr13|)) (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-13 01:01:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:51,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 01:01:51,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 01:01:51,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-04-13 01:01:51,599 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 22 states. [2018-04-13 01:01:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:52,243 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-04-13 01:01:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 01:01:52,243 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-04-13 01:01:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:52,244 INFO L225 Difference]: With dead ends: 85 [2018-04-13 01:01:52,244 INFO L226 Difference]: Without dead ends: 85 [2018-04-13 01:01:52,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=1288, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 01:01:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-13 01:01:52,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-04-13 01:01:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-13 01:01:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-04-13 01:01:52,245 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 47 [2018-04-13 01:01:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:52,246 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-04-13 01:01:52,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 01:01:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-04-13 01:01:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 01:01:52,246 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:52,246 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] [2018-04-13 01:01:52,246 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:52,246 INFO L82 PathProgramCache]: Analyzing trace with hash -799018201, now seen corresponding path program 1 times [2018-04-13 01:01:52,247 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:52,284 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:52,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:52,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 01:01:52,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:52,850 INFO L182 omatonBuilderFactory]: Interpolants [4928#(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.base| |#Ultimate.C_memcpy_dest.base|) (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)))), 4929#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr13|) (= (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|)), 4930#(or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 4 |#Ultimate.C_memcpy_#t~loopctr13|)) (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|)), 4931#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 5 |#Ultimate.C_memcpy_#t~loopctr13|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4932#(or (and (<= 6 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- (+ (- (- 5)) |#Ultimate.C_memcpy_dest.offset|)) |#Ultimate.C_memcpy_dest.offset|)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_dest.offset|)))) (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|) (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|)), 4933#(or (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (and (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- (+ (- (- 5)) |#Ultimate.C_memcpy_dest.offset|)) |#Ultimate.C_memcpy_dest.offset|)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_dest.offset|))) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|)) (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4934#(or (and (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- (+ (- (- 5)) |#Ultimate.C_memcpy_dest.offset|)) |#Ultimate.C_memcpy_dest.offset|)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_dest.offset|))) (<= 9 |#Ultimate.C_memcpy_#t~loopctr13|)) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|)) (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|)), 4935#(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.base| |#Ultimate.C_memcpy_dest.base|) (and (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- (+ (- (- 5)) |#Ultimate.C_memcpy_dest.offset|)) |#Ultimate.C_memcpy_dest.offset|)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 5)) |#Ultimate.C_memcpy_dest.offset|))) (<= 10 |#Ultimate.C_memcpy_#t~loopctr13|)) (<= 9 |#Ultimate.C_memcpy_#t~loopctr13|))), 4936#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (+ (- (+ (- (- 5)) |#Ultimate.C_memcpy_dest.offset|)) |#Ultimate.C_memcpy_dest.offset|)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ (- (- 5)) |#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)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 4937#(and (= 0 main_~p~0.offset) (= 0 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 5)))), 4938#(and (= 0 main_~p~0.offset) (= |main_#t~mem7| 0)), 4939#(= 1 (select |#valid| main_~p~0.base)), 4918#true, 4919#false, 4920#(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|))), 4921#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~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| 5))) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|))), 4922#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~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| 5))) (= 0 |main_#t~malloc0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |main_#t~malloc0.base|))), 4923#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~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| 5))) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset)), 4924#(= |#memory_int| |old(#memory_int)|), 4925#(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|)), 4926#(or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (= |#Ultimate.C_memcpy_#t~loopctr13| 0)) (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|)), 4927#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (= (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|))] [2018-04-13 01:01:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:52,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 01:01:52,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 01:01:52,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-04-13 01:01:52,851 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 22 states. [2018-04-13 01:01:53,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:53,452 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-04-13 01:01:53,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 01:01:53,452 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-04-13 01:01:53,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:53,453 INFO L225 Difference]: With dead ends: 80 [2018-04-13 01:01:53,453 INFO L226 Difference]: Without dead ends: 80 [2018-04-13 01:01:53,453 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=1287, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 01:01:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-13 01:01:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-04-13 01:01:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-13 01:01:53,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-04-13 01:01:53,455 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 49 [2018-04-13 01:01:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:53,455 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-04-13 01:01:53,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 01:01:53,456 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-04-13 01:01:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-13 01:01:53,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:53,456 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] [2018-04-13 01:01:53,456 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:53,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1224775629, now seen corresponding path program 1 times [2018-04-13 01:01:53,457 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:01:53,494 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:01:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:53,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:01:53,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 01:01:53,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:01:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:53,951 INFO L182 omatonBuilderFactory]: Interpolants [5152#(or (and (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 6)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 6))))) (not (= |#Ultimate.C_memcpy_src.offset| 0))) (<= 9 |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (<= 10 |#Ultimate.C_memcpy_#t~loopctr13|) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 5153#(or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 6)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 6))))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_dest.base| |#Ultimate.C_memcpy_src.base|)), 5154#(and (= 0 (select (select |#memory_int| main_~p~0.base) (+ main_~p~0.offset 6))) (= 0 main_~p~0.offset)), 5155#(and (= |main_#t~mem8| 0) (= 0 main_~p~0.offset)), 5156#(= 1 (select |#valid| main_~p~0.base)), 5135#true, 5136#false, 5137#(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|))), 5138#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~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| 6))) (= 1 (select |#valid| |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base|))), 5139#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~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| 6))) (= 0 |main_#t~malloc0.offset|) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| |main_#t~malloc0.base|))), 5140#(and (= 0 |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~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| 6))) (not (= |~#__U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d~0.base| main_~p~0.base)) (= 0 main_~p~0.offset)), 5141#(= |#memory_int| |old(#memory_int)|), 5142#(or (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (not (= |#Ultimate.C_memcpy_size| 10)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 5143#(or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (= |#Ultimate.C_memcpy_#t~loopctr13| 0)) (not (= |#Ultimate.C_memcpy_size| 10)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 5144#(or (and (<= 1 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|))) (not (= |#Ultimate.C_memcpy_size| 10)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 5145#(or (not (= |#Ultimate.C_memcpy_size| 10)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (and (<= 2 |#Ultimate.C_memcpy_#t~loopctr13|) (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)))), 5146#(or (not (= |#Ultimate.C_memcpy_size| 10)) (and (<= 3 |#Ultimate.C_memcpy_#t~loopctr13|) (= (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|)), 5147#(or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 4 |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_size| 10)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 5148#(or (not (= |#Ultimate.C_memcpy_size| 10)) (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 5 |#Ultimate.C_memcpy_#t~loopctr13|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 5149#(or (not (= |#Ultimate.C_memcpy_size| 10)) (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (<= 6 |#Ultimate.C_memcpy_#t~loopctr13|)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 5150#(or (and (<= 7 |#Ultimate.C_memcpy_#t~loopctr13|) (or (and (= (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (select |#memory_int| |#Ultimate.C_memcpy_src.base|)) (= (select (select |#memory_int| |#Ultimate.C_memcpy_src.base|) (+ (- (- 6)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 6)))))) (not (= |#Ultimate.C_memcpy_src.offset| 0)) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|))) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|)), 5151#(or (and (or (= (select (select |old(#memory_int)| |#Ultimate.C_memcpy_src.base|) (+ (- (- 6)) |#Ultimate.C_memcpy_src.offset|)) (select (select |#memory_int| |#Ultimate.C_memcpy_dest.base|) (+ |#Ultimate.C_memcpy_dest.offset| (- (- 6))))) (not (= |#Ultimate.C_memcpy_src.offset| 0))) (<= 8 |#Ultimate.C_memcpy_#t~loopctr13|)) (not (= |#Ultimate.C_memcpy_size| 10)) (not (= |#Ultimate.C_memcpy_dest.offset| 0)) (= |#Ultimate.C_memcpy_src.base| |#Ultimate.C_memcpy_dest.base|) (<= 9 |#Ultimate.C_memcpy_#t~loopctr13|))] [2018-04-13 01:01:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:01:53,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 01:01:53,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 01:01:53,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-04-13 01:01:53,952 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 22 states. [2018-04-13 01:01:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:01:54,470 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-04-13 01:01:54,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 01:01:54,470 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-04-13 01:01:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:01:54,470 INFO L225 Difference]: With dead ends: 75 [2018-04-13 01:01:54,470 INFO L226 Difference]: Without dead ends: 75 [2018-04-13 01:01:54,471 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 01:01:54,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-13 01:01:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-04-13 01:01:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-13 01:01:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-04-13 01:01:54,472 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 51 [2018-04-13 01:01:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:01:54,472 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-04-13 01:01:54,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 01:01:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-04-13 01:01:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 01:01:54,473 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:01:54,473 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-13 01:01:54,473 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:01:54,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1939196927, now seen corresponding path program 1 times [2018-04-13 01:01:54,473 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:01:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 01:01:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 01:01:54,536 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-13 01:01:54,549 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) [2018-04-13 01:01:54,555 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,556 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,556 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,556 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,556 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,556 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,557 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,557 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,557 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,557 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,557 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,557 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,558 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,558 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,558 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,558 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# [2018-04-13 01:01:54,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 01:01:54 BoogieIcfgContainer [2018-04-13 01:01:54,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 01:01:54,567 INFO L168 Benchmark]: Toolchain (without parser) took 11910.15 ms. Allocated memory was 392.7 MB in the beginning and 869.8 MB in the end (delta: 477.1 MB). Free memory was 334.3 MB in the beginning and 643.2 MB in the end (delta: -308.9 MB). Peak memory consumption was 168.2 MB. Max. memory is 5.3 GB. [2018-04-13 01:01:54,568 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 392.7 MB. Free memory is still 355.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 01:01:54,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.32 ms. Allocated memory is still 392.7 MB. Free memory was 334.3 MB in the beginning and 323.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-13 01:01:54,569 INFO L168 Benchmark]: Boogie Preprocessor took 30.15 ms. Allocated memory is still 392.7 MB. Free memory was 323.7 MB in the beginning and 321.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 01:01:54,569 INFO L168 Benchmark]: RCFGBuilder took 373.04 ms. Allocated memory was 392.7 MB in the beginning and 590.3 MB in the end (delta: 197.7 MB). Free memory was 321.1 MB in the beginning and 539.6 MB in the end (delta: -218.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 5.3 GB. [2018-04-13 01:01:54,569 INFO L168 Benchmark]: TraceAbstraction took 11340.08 ms. Allocated memory was 590.3 MB in the beginning and 869.8 MB in the end (delta: 279.4 MB). Free memory was 539.6 MB in the beginning and 643.2 MB in the end (delta: -103.6 MB). Peak memory consumption was 175.9 MB. Max. memory is 5.3 GB. [2018-04-13 01:01:54,571 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 392.7 MB. Free memory is still 355.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.32 ms. Allocated memory is still 392.7 MB. Free memory was 334.3 MB in the beginning and 323.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.15 ms. Allocated memory is still 392.7 MB. Free memory was 323.7 MB in the beginning and 321.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 373.04 ms. Allocated memory was 392.7 MB in the beginning and 590.3 MB in the end (delta: 197.7 MB). Free memory was 321.1 MB in the beginning and 539.6 MB in the end (delta: -218.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11340.08 ms. Allocated memory was 590.3 MB in the beginning and 869.8 MB in the end (delta: 279.4 MB). Free memory was 539.6 MB in the beginning and 643.2 MB in the end (delta: -103.6 MB). Peak memory consumption was 175.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 11 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT#?a~UCHAR?b~UCHAR?c~UCHAR?d~UCHAR?e~UCHAR?pad~UCHAR?f~UINT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 66]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L36] FCALL struct A d = {.b = 3}; VAL [\old(d)=null, \old(d)=null, d={18:0}] [L39] struct B *p; VAL [d={18:0}] [L40] EXPR, FCALL malloc(sizeof(struct B)) VAL [d={18:0}, malloc(sizeof(struct B))={12:0}] [L40] p = malloc(sizeof(struct B)) VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}] [L41] FCALL memcpy(p, &d, sizeof(struct B)) VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, memcpy(p, &d, sizeof(struct B))={12:0}, p={12:0}] [L42] EXPR, FCALL p->a VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}, p->a=0] [L42] COND FALSE !(p->a != 0) [L45] EXPR, FCALL p->b VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}, p->b=3] [L45] COND FALSE !(p->b != 3) [L48] EXPR, FCALL p->c VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}, p->c=0] [L48] COND FALSE !(p->c != 0) [L51] EXPR, FCALL p->d VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}, p->d=0] [L51] COND FALSE !(p->d != 0) [L54] EXPR, FCALL p->e VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}, p->e=0] [L54] COND FALSE !(p->e != 0) [L57] EXPR, FCALL p->f VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}, p->f=0] [L57] COND FALSE !(p->f != 0) [L60] EXPR, FCALL p->f1 VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}, p->f1=0] [L60] COND FALSE !(p->f1 != 0) [L63] EXPR, FCALL p->f2 VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}, p->f2=-255] [L63] COND TRUE p->f2 != 0 [L64] free(p) VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}] [L64] free(p) VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}] [L64] FCALL free(p) VAL [d={18:0}, malloc(sizeof(struct B))={12:0}, p={12:0}] [L66] FCALL p->f3 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 127 locations, 47 error locations. UNSAFE Result, 11.3s OverallTime, 23 OverallIterations, 11 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1514 SDtfs, 2849 SDslu, 6123 SDs, 0 SdLazy, 5357 SolverSat, 633 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 75 SyntacticMatches, 16 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1966 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 140/616 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, 22 MinimizatonAttempts, 219 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 811 NumberOfCodeBlocks, 811 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 736 ConstructedInterpolants, 0 QuantifiedInterpolants, 283035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 5 PerfectInterpolantSequences, 140/616 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_01-01-54-579.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_01-01-54-579.csv Received shutdown request...