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_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 17:17:11,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 17:17:11,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 17:17:11,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 17:17:11,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 17:17:11,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 17:17:11,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 17:17:11,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 17:17:11,130 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 17:17:11,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 17:17:11,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 17:17:11,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 17:17:11,133 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 17:17:11,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 17:17:11,134 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 17:17:11,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 17:17:11,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 17:17:11,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 17:17:11,139 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 17:17:11,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 17:17:11,142 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 17:17:11,142 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 17:17:11,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 17:17:11,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 17:17:11,144 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 17:17:11,145 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 17:17:11,145 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 17:17:11,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 17:17:11,146 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 17:17:11,146 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 17:17:11,147 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 17:17:11,147 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_NoArray.epf [2018-04-11 17:17:11,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 17:17:11,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 17:17:11,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 17:17:11,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 17:17:11,169 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 17:17:11,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 17:17:11,169 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 17:17:11,169 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 17:17:11,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 17:17:11,169 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 17:17:11,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 17:17:11,169 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 17:17:11,169 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 17:17:11,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 17:17:11,170 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 17:17:11,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 17:17:11,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 17:17:11,170 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 17:17:11,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 17:17:11,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 17:17:11,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 17:17:11,170 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 17:17:11,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 17:17:11,171 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 17:17:11,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 17:17:11,207 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 17:17:11,209 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 17:17:11,210 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 17:17:11,211 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 17:17:11,211 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_false-valid-deref.i [2018-04-11 17:17:11,515 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa41ef401c [2018-04-11 17:17:11,608 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 17:17:11,608 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 17:17:11,609 INFO L168 CDTParser]: Scanning test-bitfields-3_false-valid-deref.i [2018-04-11 17:17:11,610 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 17:17:11,610 INFO L215 ultiparseSymbolTable]: [2018-04-11 17:17:11,610 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 17:17:11,610 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_false-valid-deref.i [2018-04-11 17:17:11,610 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 17:17:11,610 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-3_false-valid-deref.i [2018-04-11 17:17:11,610 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-3_false-valid-deref.i [2018-04-11 17:17:11,622 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa41ef401c [2018-04-11 17:17:11,625 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 17:17:11,626 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 17:17:11,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 17:17:11,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 17:17:11,631 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 17:17:11,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:17:11" (1/1) ... [2018-04-11 17:17:11,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262dfcb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:17:11, skipping insertion in model container [2018-04-11 17:17:11,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:17:11" (1/1) ... [2018-04-11 17:17:11,644 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:17:11,655 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:17:11,758 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:17:11,780 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:17:11,785 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 17:17:11,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:17:11 WrapperNode [2018-04-11 17:17:11,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 17:17:11,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 17:17:11,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 17:17:11,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 17:17:11,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:17:11" (1/1) ... [2018-04-11 17:17:11,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:17:11" (1/1) ... [2018-04-11 17:17:11,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:17:11" (1/1) ... [2018-04-11 17:17:11,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:17:11" (1/1) ... [2018-04-11 17:17:11,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:17:11" (1/1) ... [2018-04-11 17:17:11,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:17:11" (1/1) ... [2018-04-11 17:17:11,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:17:11" (1/1) ... [2018-04-11 17:17:11,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 17:17:11,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 17:17:11,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 17:17:11,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 17:17:11,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:17:11" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 17:17:11,861 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 17:17:11,861 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 17:17:11,861 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 17:17:11,861 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 17:17:11,861 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 17:17:11,861 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 17:17:11,861 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 17:17:11,861 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 17:17:11,861 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 17:17:11,861 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 17:17:11,861 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 17:17:11,862 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 17:17:11,862 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 17:17:11,862 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 17:17:11,862 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 17:17:11,862 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 17:17:12,191 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 17:17:12,199 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 17:17:12,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:17:12 BoogieIcfgContainer [2018-04-11 17:17:12,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 17:17:12,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 17:17:12,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 17:17:12,203 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 17:17:12,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 05:17:11" (1/3) ... [2018-04-11 17:17:12,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a92189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:17:12, skipping insertion in model container [2018-04-11 17:17:12,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:17:11" (2/3) ... [2018-04-11 17:17:12,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a92189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:17:12, skipping insertion in model container [2018-04-11 17:17:12,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:17:12" (3/3) ... [2018-04-11 17:17:12,206 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_false-valid-deref.i [2018-04-11 17:17:12,213 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 17:17:12,220 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-11 17:17:12,245 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 17:17:12,246 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 17:17:12,246 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 17:17:12,246 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 17:17:12,247 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 17:17:12,247 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 17:17:12,247 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 17:17:12,247 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 17:17:12,247 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 17:17:12,248 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 17:17:12,260 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-04-11 17:17:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 17:17:12,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:12,266 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:17:12,267 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-11 17:17:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash -383275974, now seen corresponding path program 1 times [2018-04-11 17:17:12,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:12,271 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:12,299 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:12,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:12,299 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:12,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:12,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:17:12,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:17:12,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:17:12,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:17:12,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:17:12,413 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 4 states. [2018-04-11 17:17:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:12,666 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-04-11 17:17:12,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:17:12,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 17:17:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:12,679 INFO L225 Difference]: With dead ends: 202 [2018-04-11 17:17:12,680 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 17:17:12,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:17:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 17:17:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2018-04-11 17:17:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 17:17:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-04-11 17:17:12,717 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 17 [2018-04-11 17:17:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:12,719 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-04-11 17:17:12,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:17:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-04-11 17:17:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 17:17:12,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:12,720 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:17:12,720 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-11 17:17:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash -383275973, now seen corresponding path program 1 times [2018-04-11 17:17:12,720 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:12,721 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:12,721 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:12,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:12,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:12,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:12,743 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:17:12,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:12,743 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:12,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:12,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:12,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:17:12,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:12,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:12,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 17:17:12,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:17:12,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:12,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:17:12,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 17:17:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:12,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:17:12,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 17:17:12,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 17:17:12,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 17:17:12,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:17:12,825 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 3 states. [2018-04-11 17:17:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:12,941 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-04-11 17:17:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 17:17:12,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-11 17:17:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:12,943 INFO L225 Difference]: With dead ends: 188 [2018-04-11 17:17:12,944 INFO L226 Difference]: Without dead ends: 188 [2018-04-11 17:17:12,944 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:17:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-11 17:17:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 122. [2018-04-11 17:17:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 17:17:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-04-11 17:17:12,953 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 17 [2018-04-11 17:17:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:12,953 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-04-11 17:17:12,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 17:17:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-04-11 17:17:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 17:17:12,954 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:12,954 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:17:12,954 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-11 17:17:12,954 INFO L82 PathProgramCache]: Analyzing trace with hash -383275972, now seen corresponding path program 1 times [2018-04-11 17:17:12,954 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:12,955 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:12,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:12,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:12,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:12,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:17:13,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:17:13,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:17:13,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:17:13,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:17:13,006 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 4 states. [2018-04-11 17:17:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:13,085 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-11 17:17:13,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:17:13,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 17:17:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:13,087 INFO L225 Difference]: With dead ends: 100 [2018-04-11 17:17:13,087 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 17:17:13,087 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:17:13,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 17:17:13,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-11 17:17:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 17:17:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-11 17:17:13,092 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 17 [2018-04-11 17:17:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:13,092 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-11 17:17:13,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:17:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-11 17:17:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 17:17:13,093 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:13,093 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:17:13,093 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-11 17:17:13,094 INFO L82 PathProgramCache]: Analyzing trace with hash -383275971, now seen corresponding path program 1 times [2018-04-11 17:17:13,094 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:13,094 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:13,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:13,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:13,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:13,108 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:17:13,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:13,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:13,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:13,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:13,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:17:13,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:13,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:13,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:17:13,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:17:13,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:13,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:17:13,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-11 17:17:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:17:13,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 17:17:13,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 17:17:13,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 17:17:13,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:17:13,151 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 3 states. [2018-04-11 17:17:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:13,165 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-04-11 17:17:13,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 17:17:13,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-11 17:17:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:13,166 INFO L225 Difference]: With dead ends: 99 [2018-04-11 17:17:13,167 INFO L226 Difference]: Without dead ends: 99 [2018-04-11 17:17:13,167 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:17:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-11 17:17:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-04-11 17:17:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 17:17:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-04-11 17:17:13,171 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 17 [2018-04-11 17:17:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:13,172 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-04-11 17:17:13,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 17:17:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-04-11 17:17:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 17:17:13,172 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:13,172 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-11 17:17:13,172 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-11 17:17:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1560963691, now seen corresponding path program 1 times [2018-04-11 17:17:13,173 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:13,173 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:13,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:13,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:13,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:17:13,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:17:13,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:17:13,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:17:13,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:17:13,217 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2018-04-11 17:17:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:13,238 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-04-11 17:17:13,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:17:13,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-11 17:17:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:13,239 INFO L225 Difference]: With dead ends: 102 [2018-04-11 17:17:13,239 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 17:17:13,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:17:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 17:17:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-11 17:17:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 17:17:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-11 17:17:13,244 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 29 [2018-04-11 17:17:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:13,244 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-11 17:17:13,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:17:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-11 17:17:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 17:17:13,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:13,245 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-11 17:17:13,245 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-11 17:17:13,245 INFO L82 PathProgramCache]: Analyzing trace with hash 730350873, now seen corresponding path program 1 times [2018-04-11 17:17:13,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:13,245 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:13,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:13,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:13,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:13,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:13,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:13,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:17:13,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-11 17:17:13,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 17:17:13,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 17:17:13,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:17:13,348 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 8 states. [2018-04-11 17:17:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:13,386 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-04-11 17:17:13,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:17:13,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-04-11 17:17:13,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:13,390 INFO L225 Difference]: With dead ends: 103 [2018-04-11 17:17:13,391 INFO L226 Difference]: Without dead ends: 101 [2018-04-11 17:17:13,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-11 17:17:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-11 17:17:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-04-11 17:17:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 17:17:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-04-11 17:17:13,394 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 30 [2018-04-11 17:17:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:13,404 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-04-11 17:17:13,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 17:17:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-04-11 17:17:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 17:17:13,405 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:13,405 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-11 17:17:13,405 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-11 17:17:13,406 INFO L82 PathProgramCache]: Analyzing trace with hash 751157291, now seen corresponding path program 2 times [2018-04-11 17:17:13,406 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:13,406 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:13,407 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:13,407 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:13,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:13,461 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:13,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:17:13,490 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:17:13,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:17:13,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:17:13,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-11 17:17:13,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 17:17:13,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 17:17:13,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-11 17:17:13,516 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 10 states. [2018-04-11 17:17:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:13,563 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-04-11 17:17:13,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:17:13,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-04-11 17:17:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:13,565 INFO L225 Difference]: With dead ends: 104 [2018-04-11 17:17:13,565 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 17:17:13,565 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-11 17:17:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 17:17:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-04-11 17:17:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-11 17:17:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-04-11 17:17:13,569 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 31 [2018-04-11 17:17:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:13,570 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-04-11 17:17:13,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 17:17:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-04-11 17:17:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 17:17:13,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:13,571 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-11 17:17:13,571 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-11 17:17:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1396156249, now seen corresponding path program 3 times [2018-04-11 17:17:13,571 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:13,571 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:13,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:17:13,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:13,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:13,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:13,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:17:13,657 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 17:17:13,658 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:17:13,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:17:13,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-11 17:17:13,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 17:17:13,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 17:17:13,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-11 17:17:13,692 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 12 states. [2018-04-11 17:17:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:13,720 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-04-11 17:17:13,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:17:13,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-04-11 17:17:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:13,722 INFO L225 Difference]: With dead ends: 105 [2018-04-11 17:17:13,722 INFO L226 Difference]: Without dead ends: 103 [2018-04-11 17:17:13,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:17:13,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-11 17:17:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-04-11 17:17:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 17:17:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-04-11 17:17:13,725 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 32 [2018-04-11 17:17:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:13,725 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-04-11 17:17:13,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 17:17:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-04-11 17:17:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 17:17:13,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:13,726 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-11 17:17:13,727 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-11 17:17:13,727 INFO L82 PathProgramCache]: Analyzing trace with hash -83712533, now seen corresponding path program 4 times [2018-04-11 17:17:13,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:13,727 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:13,728 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:17:13,728 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:13,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:13,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:13,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 17:17:13,805 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 17:17:13,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:17:13,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:17:13,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-04-11 17:17:13,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 17:17:13,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 17:17:13,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:17:13,849 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 14 states. [2018-04-11 17:17:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:13,885 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-04-11 17:17:13,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 17:17:13,886 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-11 17:17:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:13,887 INFO L225 Difference]: With dead ends: 106 [2018-04-11 17:17:13,887 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 17:17:13,887 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-04-11 17:17:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 17:17:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-11 17:17:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 17:17:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-04-11 17:17:13,891 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 33 [2018-04-11 17:17:13,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:13,895 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-04-11 17:17:13,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 17:17:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-04-11 17:17:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 17:17:13,896 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:13,896 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-11 17:17:13,896 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-11 17:17:13,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1284995481, now seen corresponding path program 5 times [2018-04-11 17:17:13,897 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:13,897 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:13,897 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:17:13,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:13,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:13,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:13,975 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:13,975 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 17:17:13,991 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-11 17:17:13,991 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:17:13,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:14,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:17:14,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-11 17:17:14,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 17:17:14,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 17:17:14,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-04-11 17:17:14,035 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 16 states. [2018-04-11 17:17:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:14,060 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-04-11 17:17:14,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 17:17:14,060 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-04-11 17:17:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:14,061 INFO L225 Difference]: With dead ends: 107 [2018-04-11 17:17:14,061 INFO L226 Difference]: Without dead ends: 105 [2018-04-11 17:17:14,061 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-04-11 17:17:14,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-11 17:17:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-04-11 17:17:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 17:17:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-04-11 17:17:14,064 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 34 [2018-04-11 17:17:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:14,064 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-04-11 17:17:14,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 17:17:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-04-11 17:17:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 17:17:14,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:14,066 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-11 17:17:14,066 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-11 17:17:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash 765270955, now seen corresponding path program 6 times [2018-04-11 17:17:14,066 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:14,066 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:14,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:14,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:17:14,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:14,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:14,144 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:14,144 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:14,145 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 17:17:14,180 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-11 17:17:14,180 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:17:14,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:14,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:17:14,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-11 17:17:14,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 17:17:14,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 17:17:14,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-04-11 17:17:14,230 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 18 states. [2018-04-11 17:17:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:14,257 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-04-11 17:17:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 17:17:14,257 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-04-11 17:17:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:14,259 INFO L225 Difference]: With dead ends: 108 [2018-04-11 17:17:14,259 INFO L226 Difference]: Without dead ends: 106 [2018-04-11 17:17:14,259 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:17:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-11 17:17:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-04-11 17:17:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 17:17:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-04-11 17:17:14,261 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 35 [2018-04-11 17:17:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:14,261 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-04-11 17:17:14,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 17:17:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-04-11 17:17:14,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 17:17:14,261 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:14,261 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-11 17:17:14,261 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-11 17:17:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1833679833, now seen corresponding path program 7 times [2018-04-11 17:17:14,262 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:14,262 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:14,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:14,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:17:14,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:14,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:14,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:14,345 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:14,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:14,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:14,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:17:14,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-11 17:17:14,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:17:14,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:17:14,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:17:14,430 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 20 states. [2018-04-11 17:17:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:14,475 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-04-11 17:17:14,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 17:17:14,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-04-11 17:17:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:14,476 INFO L225 Difference]: With dead ends: 109 [2018-04-11 17:17:14,476 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 17:17:14,476 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2018-04-11 17:17:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 17:17:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-04-11 17:17:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-11 17:17:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-04-11 17:17:14,478 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 36 [2018-04-11 17:17:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:14,478 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-04-11 17:17:14,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:17:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-04-11 17:17:14,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 17:17:14,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:14,478 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-11 17:17:14,478 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-11 17:17:14,479 INFO L82 PathProgramCache]: Analyzing trace with hash 594616683, now seen corresponding path program 8 times [2018-04-11 17:17:14,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:14,479 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:14,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:14,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:17:14,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:14,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:14,587 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:14,587 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:14,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:17:14,605 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:17:14,606 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:17:14,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:14,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:17:14,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-04-11 17:17:14,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 17:17:14,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 17:17:14,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2018-04-11 17:17:14,668 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 22 states. [2018-04-11 17:17:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:14,698 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-04-11 17:17:14,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 17:17:14,698 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-04-11 17:17:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:14,699 INFO L225 Difference]: With dead ends: 110 [2018-04-11 17:17:14,699 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 17:17:14,699 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2018-04-11 17:17:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 17:17:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-11 17:17:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 17:17:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2018-04-11 17:17:14,702 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2018-04-11 17:17:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:14,702 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2018-04-11 17:17:14,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 17:17:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-04-11 17:17:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 17:17:14,703 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:14,703 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-11 17:17:14,703 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-11 17:17:14,703 INFO L82 PathProgramCache]: Analyzing trace with hash 838364697, now seen corresponding path program 9 times [2018-04-11 17:17:14,704 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:14,704 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:14,704 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:14,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:17:14,704 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:14,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:14,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:14,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:14,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:17:14,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-11 17:17:14,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:17:14,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:17:14,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:17:14,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-04-11 17:17:14,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 17:17:14,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 17:17:14,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2018-04-11 17:17:14,926 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 24 states. [2018-04-11 17:17:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:17:14,969 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-04-11 17:17:14,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 17:17:14,970 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 38 [2018-04-11 17:17:14,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:17:14,970 INFO L225 Difference]: With dead ends: 111 [2018-04-11 17:17:14,970 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 17:17:14,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2018-04-11 17:17:14,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 17:17:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-04-11 17:17:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-11 17:17:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2018-04-11 17:17:14,972 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 38 [2018-04-11 17:17:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:17:14,972 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2018-04-11 17:17:14,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 17:17:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2018-04-11 17:17:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 17:17:14,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:17:14,973 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-11 17:17:14,973 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-11 17:17:14,973 INFO L82 PathProgramCache]: Analyzing trace with hash -195381461, now seen corresponding path program 10 times [2018-04-11 17:17:14,973 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:17:14,973 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:17:14,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:14,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:17:14,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:17:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:17:15,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:17:15,047 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:17:15,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:17:15,048 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:17:15,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 17:17:15,084 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 17:17:15,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:17:15,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:17:15,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:17:15,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:17:15,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 17:17:15,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 17:17:15,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-04-11 17:17:15,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 17:17:15,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 17:17:15,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 60 [2018-04-11 17:17:15,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-11 17:17:15,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-11 17:17:15,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 93 [2018-04-11 17:17:15,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-11 17:17:15,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-11 17:17:15,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 132 [2018-04-11 17:17:15,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-11 17:17:15,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-04-11 17:17:15,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 179 [2018-04-11 17:17:15,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-11 17:17:15,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-04-11 17:17:15,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 234 [2018-04-11 17:17:15,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-04-11 17:17:15,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2018-04-11 17:17:15,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:17:15,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 157 [2018-04-11 17:17:15,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:17:15,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-04-11 17:17:16,623 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 77 [2018-04-11 17:17:17,349 WARN L148 SmtUtils]: Spent 210ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-11 17:17:18,228 WARN L148 SmtUtils]: Spent 131ms on a formula simplification that was a NOOP. DAG size: 84 Received shutdown request... [2018-04-11 17:20:59,050 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 17:20:59,051 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 17:20:59,054 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 17:20:59,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 05:20:59 BoogieIcfgContainer [2018-04-11 17:20:59,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 17:20:59,055 INFO L168 Benchmark]: Toolchain (without parser) took 227430.20 ms. Allocated memory was 400.6 MB in the beginning and 735.1 MB in the end (delta: 334.5 MB). Free memory was 338.4 MB in the beginning and 569.2 MB in the end (delta: -230.8 MB). Peak memory consumption was 206.0 MB. Max. memory is 5.3 GB. [2018-04-11 17:20:59,056 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 400.6 MB. Free memory is still 357.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 17:20:59,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.01 ms. Allocated memory is still 400.6 MB. Free memory was 338.4 MB in the beginning and 327.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-04-11 17:20:59,057 INFO L168 Benchmark]: Boogie Preprocessor took 28.03 ms. Allocated memory is still 400.6 MB. Free memory was 327.2 MB in the beginning and 324.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 17:20:59,057 INFO L168 Benchmark]: RCFGBuilder took 377.16 ms. Allocated memory was 400.6 MB in the beginning and 609.7 MB in the end (delta: 209.2 MB). Free memory was 324.6 MB in the beginning and 562.0 MB in the end (delta: -237.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-04-11 17:20:59,057 INFO L168 Benchmark]: TraceAbstraction took 226854.31 ms. Allocated memory was 609.7 MB in the beginning and 735.1 MB in the end (delta: 125.3 MB). Free memory was 562.0 MB in the beginning and 569.2 MB in the end (delta: -7.2 MB). Peak memory consumption was 220.4 MB. Max. memory is 5.3 GB. [2018-04-11 17:20:59,058 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 400.6 MB. Free memory is still 357.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.01 ms. Allocated memory is still 400.6 MB. Free memory was 338.4 MB in the beginning and 327.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.03 ms. Allocated memory is still 400.6 MB. Free memory was 327.2 MB in the beginning and 324.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 377.16 ms. Allocated memory was 400.6 MB in the beginning and 609.7 MB in the end (delta: 209.2 MB). Free memory was 324.6 MB in the beginning and 562.0 MB in the end (delta: -237.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 226854.31 ms. Allocated memory was 609.7 MB in the beginning and 735.1 MB in the end (delta: 125.3 MB). Free memory was 562.0 MB in the beginning and 569.2 MB in the end (delta: -7.2 MB). Peak memory consumption was 220.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3699. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 127 locations, 47 error locations. TIMEOUT Result, 226.8s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1242 SDtfs, 566 SDslu, 7296 SDs, 0 SdLazy, 618 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 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, 14 MinimizatonAttempts, 142 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 743 NumberOfCodeBlocks, 742 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 686 ConstructedInterpolants, 0 QuantifiedInterpolants, 44514 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1292 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 0/330 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_17-20-59-065.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_17-20-59-065.csv Completed graceful shutdown