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_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 12:00:07,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 12:00:07,544 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 12:00:07,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 12:00:07,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 12:00:07,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 12:00:07,558 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 12:00:07,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 12:00:07,561 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 12:00:07,562 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 12:00:07,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 12:00:07,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 12:00:07,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 12:00:07,565 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 12:00:07,565 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 12:00:07,567 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 12:00:07,568 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 12:00:07,570 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 12:00:07,570 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 12:00:07,571 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 12:00:07,573 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 12:00:07,573 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 12:00:07,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 12:00:07,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 12:00:07,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 12:00:07,576 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 12:00:07,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 12:00:07,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 12:00:07,577 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 12:00:07,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 12:00:07,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 12:00:07,578 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 12:00:07,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 12:00:07,598 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 12:00:07,599 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 12:00:07,599 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 12:00:07,600 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 12:00:07,600 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 12:00:07,600 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 12:00:07,600 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 12:00:07,600 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 12:00:07,600 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 12:00:07,600 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 12:00:07,600 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 12:00:07,600 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 12:00:07,600 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 12:00:07,601 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 12:00:07,601 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 12:00:07,601 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 12:00:07,601 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 12:00:07,601 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 12:00:07,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 12:00:07,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 12:00:07,601 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 12:00:07,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 12:00:07,602 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 12:00:07,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 12:00:07,639 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 12:00:07,642 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 12:00:07,643 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 12:00:07,644 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 12:00:07,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 12:00:07,978 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG220719f83 [2018-04-11 12:00:08,076 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 12:00:08,076 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 12:00:08,077 INFO L168 CDTParser]: Scanning test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 12:00:08,078 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 12:00:08,078 INFO L215 ultiparseSymbolTable]: [2018-04-11 12:00:08,078 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 12:00:08,078 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 12:00:08,078 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 12:00:08,078 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 12:00:08,079 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 12:00:08,090 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG220719f83 [2018-04-11 12:00:08,093 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 12:00:08,094 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 12:00:08,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 12:00:08,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 12:00:08,098 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 12:00:08,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:00:08" (1/1) ... [2018-04-11 12:00:08,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280bebcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:00:08, skipping insertion in model container [2018-04-11 12:00:08,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:00:08" (1/1) ... [2018-04-11 12:00:08,111 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:00:08,121 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:00:08,215 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:00:08,240 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:00:08,245 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 12:00:08,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:00:08 WrapperNode [2018-04-11 12:00:08,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 12:00:08,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 12:00:08,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 12:00:08,256 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 12:00:08,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:00:08" (1/1) ... [2018-04-11 12:00:08,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:00:08" (1/1) ... [2018-04-11 12:00:08,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:00:08" (1/1) ... [2018-04-11 12:00:08,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:00:08" (1/1) ... [2018-04-11 12:00:08,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:00:08" (1/1) ... [2018-04-11 12:00:08,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:00:08" (1/1) ... [2018-04-11 12:00:08,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:00:08" (1/1) ... [2018-04-11 12:00:08,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 12:00:08,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 12:00:08,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 12:00:08,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 12:00:08,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:00:08" (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 12:00:08,320 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 12:00:08,320 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 12:00:08,320 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 12:00:08,320 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 12:00:08,320 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 12:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 12:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 12:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 12:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 12:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 12:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 12:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 12:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 12:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 12:00:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 12:00:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 12:00:08,646 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 12:00:08,654 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 12:00:08,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:00:08 BoogieIcfgContainer [2018-04-11 12:00:08,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 12:00:08,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 12:00:08,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 12:00:08,658 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 12:00:08,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 12:00:08" (1/3) ... [2018-04-11 12:00:08,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3687d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:00:08, skipping insertion in model container [2018-04-11 12:00:08,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:00:08" (2/3) ... [2018-04-11 12:00:08,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3687d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:00:08, skipping insertion in model container [2018-04-11 12:00:08,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:00:08" (3/3) ... [2018-04-11 12:00:08,661 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 12:00:08,670 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 12:00:08,677 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-11 12:00:08,703 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 12:00:08,704 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 12:00:08,704 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 12:00:08,704 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 12:00:08,704 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 12:00:08,704 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 12:00:08,704 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 12:00:08,704 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 12:00:08,704 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 12:00:08,705 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 12:00:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-04-11 12:00:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 12:00:08,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:08,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 12:00:08,721 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 12:00:08,723 INFO L82 PathProgramCache]: Analyzing trace with hash -383275974, now seen corresponding path program 1 times [2018-04-11 12:00:08,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:08,725 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:08,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:08,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:00:08,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:08,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:00:08,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:00:08,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:00:08,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:00:08,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:00:08,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:00:08,871 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 4 states. [2018-04-11 12:00:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:09,083 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-04-11 12:00:09,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:00:09,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 12:00:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:09,096 INFO L225 Difference]: With dead ends: 202 [2018-04-11 12:00:09,096 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 12:00:09,097 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 12:00:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 12:00:09,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2018-04-11 12:00:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 12:00:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-04-11 12:00:09,129 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 17 [2018-04-11 12:00:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:09,129 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-04-11 12:00:09,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:00:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-04-11 12:00:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 12:00:09,130 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:09,130 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 12:00:09,130 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 12:00:09,130 INFO L82 PathProgramCache]: Analyzing trace with hash -383275973, now seen corresponding path program 1 times [2018-04-11 12:00:09,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:09,131 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:09,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:00:09,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:09,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:09,186 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 12:00:09,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:00:09,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 12:00:09,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 12:00:09,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 12:00:09,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 12:00:09,189 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 3 states. [2018-04-11 12:00:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:09,296 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-04-11 12:00:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 12:00:09,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-11 12:00:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:09,297 INFO L225 Difference]: With dead ends: 188 [2018-04-11 12:00:09,298 INFO L226 Difference]: Without dead ends: 188 [2018-04-11 12:00:09,298 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 12:00:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-11 12:00:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 122. [2018-04-11 12:00:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 12:00:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-04-11 12:00:09,307 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 17 [2018-04-11 12:00:09,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:09,307 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-04-11 12:00:09,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 12:00:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-04-11 12:00:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 12:00:09,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:09,308 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 12:00:09,308 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 12:00:09,308 INFO L82 PathProgramCache]: Analyzing trace with hash -383275972, now seen corresponding path program 1 times [2018-04-11 12:00:09,308 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:09,309 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:09,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:00:09,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:09,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:00:09,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:00:09,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:00:09,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:00:09,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:00:09,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:00:09,395 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 4 states. [2018-04-11 12:00:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:09,483 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-11 12:00:09,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:00:09,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-11 12:00:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:09,485 INFO L225 Difference]: With dead ends: 100 [2018-04-11 12:00:09,485 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 12:00:09,485 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 12:00:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 12:00:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-11 12:00:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 12:00:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-11 12:00:09,489 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 17 [2018-04-11 12:00:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:09,489 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-11 12:00:09,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:00:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-11 12:00:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 12:00:09,489 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:09,490 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 12:00:09,490 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 12:00:09,490 INFO L82 PathProgramCache]: Analyzing trace with hash -383275971, now seen corresponding path program 1 times [2018-04-11 12:00:09,490 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:09,490 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:09,491 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:00:09,491 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:09,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:09,545 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 12:00:09,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:00:09,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 12:00:09,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 12:00:09,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 12:00:09,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 12:00:09,546 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 3 states. [2018-04-11 12:00:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:09,570 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-04-11 12:00:09,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 12:00:09,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-11 12:00:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:09,571 INFO L225 Difference]: With dead ends: 99 [2018-04-11 12:00:09,571 INFO L226 Difference]: Without dead ends: 99 [2018-04-11 12:00:09,571 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 12:00:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-11 12:00:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-04-11 12:00:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 12:00:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-04-11 12:00:09,576 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 17 [2018-04-11 12:00:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:09,576 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-04-11 12:00:09,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 12:00:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-04-11 12:00:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 12:00:09,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:09,577 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 12:00:09,577 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 12:00:09,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1560963691, now seen corresponding path program 1 times [2018-04-11 12:00:09,577 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:09,577 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:09,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:00:09,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:09,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:09,621 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 12:00:09,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:00:09,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:00:09,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:00:09,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:00:09,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:00:09,622 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2018-04-11 12:00:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:09,632 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-04-11 12:00:09,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:00:09,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-11 12:00:09,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:09,633 INFO L225 Difference]: With dead ends: 102 [2018-04-11 12:00:09,633 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 12:00:09,634 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 12:00:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 12:00:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-11 12:00:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 12:00:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-11 12:00:09,638 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 29 [2018-04-11 12:00:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:09,638 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-11 12:00:09,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:00:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-11 12:00:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 12:00:09,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:09,639 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 12:00:09,639 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 12:00:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash 730350873, now seen corresponding path program 1 times [2018-04-11 12:00:09,640 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:09,640 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:09,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:00:09,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:09,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:09,696 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 12:00:09,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:00:09,697 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:00:09,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:00:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:09,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:00:09,750 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 12:00:09,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:00:09,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-11 12:00:09,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:00:09,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:00:09,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:00:09,767 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 8 states. [2018-04-11 12:00:09,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:09,812 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-04-11 12:00:09,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:00:09,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-04-11 12:00:09,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:09,813 INFO L225 Difference]: With dead ends: 103 [2018-04-11 12:00:09,813 INFO L226 Difference]: Without dead ends: 101 [2018-04-11 12:00:09,814 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 12:00:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-11 12:00:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-04-11 12:00:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 12:00:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-04-11 12:00:09,817 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 30 [2018-04-11 12:00:09,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:09,817 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-04-11 12:00:09,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:00:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-04-11 12:00:09,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 12:00:09,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:09,818 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 12:00:09,819 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 12:00:09,819 INFO L82 PathProgramCache]: Analyzing trace with hash 751157291, now seen corresponding path program 2 times [2018-04-11 12:00:09,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:09,819 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:09,820 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:00:09,820 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:09,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:09,878 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 12:00:09,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:00:09,879 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:00:09,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 12:00:09,908 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 12:00:09,908 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:00:09,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:00:09,939 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 12:00:09,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:00:09,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-11 12:00:09,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 12:00:09,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 12:00:09,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-11 12:00:09,958 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 10 states. [2018-04-11 12:00:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:09,995 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-04-11 12:00:09,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:00:09,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-04-11 12:00:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:09,996 INFO L225 Difference]: With dead ends: 104 [2018-04-11 12:00:09,996 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 12:00:09,997 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 12:00:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 12:00:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-04-11 12:00:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-11 12:00:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-04-11 12:00:10,000 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 31 [2018-04-11 12:00:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:10,000 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-04-11 12:00:10,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 12:00:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-04-11 12:00:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 12:00:10,001 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:10,001 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 12:00:10,001 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 12:00:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1396156249, now seen corresponding path program 3 times [2018-04-11 12:00:10,001 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:10,002 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:10,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:10,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:00:10,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:10,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:10,064 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 12:00:10,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:00:10,064 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:00:10,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 12:00:10,109 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 12:00:10,109 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:00:10,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:00:10,154 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 12:00:10,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:00:10,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-11 12:00:10,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 12:00:10,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 12:00:10,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-11 12:00:10,173 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 12 states. [2018-04-11 12:00:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:10,198 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-04-11 12:00:10,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 12:00:10,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-04-11 12:00:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:10,199 INFO L225 Difference]: With dead ends: 105 [2018-04-11 12:00:10,199 INFO L226 Difference]: Without dead ends: 103 [2018-04-11 12:00:10,199 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 12:00:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-11 12:00:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-04-11 12:00:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 12:00:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-04-11 12:00:10,202 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 32 [2018-04-11 12:00:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:10,202 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-04-11 12:00:10,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 12:00:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-04-11 12:00:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 12:00:10,203 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:10,203 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 12:00:10,203 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 12:00:10,203 INFO L82 PathProgramCache]: Analyzing trace with hash -83712533, now seen corresponding path program 4 times [2018-04-11 12:00:10,203 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:10,204 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:10,204 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:10,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:00:10,204 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:10,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:10,276 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 12:00:10,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:00:10,277 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:00:10,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 12:00:10,301 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 12:00:10,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:00:10,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:00:10,354 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 12:00:10,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:00:10,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-04-11 12:00:10,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 12:00:10,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 12:00:10,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-04-11 12:00:10,383 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 14 states. [2018-04-11 12:00:10,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:10,421 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-04-11 12:00:10,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 12:00:10,421 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-11 12:00:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:10,422 INFO L225 Difference]: With dead ends: 106 [2018-04-11 12:00:10,422 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 12:00:10,423 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 12:00:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 12:00:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-11 12:00:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 12:00:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-04-11 12:00:10,426 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 33 [2018-04-11 12:00:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:10,426 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-04-11 12:00:10,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 12:00:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-04-11 12:00:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 12:00:10,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:10,427 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 12:00:10,428 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 12:00:10,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1284995481, now seen corresponding path program 5 times [2018-04-11 12:00:10,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:10,428 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:10,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:10,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:00:10,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:10,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:10,496 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 12:00:10,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:00:10,497 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:00:10,502 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 12:00:10,523 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-11 12:00:10,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:00:10,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:00:10,572 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 12:00:10,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:00:10,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-11 12:00:10,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 12:00:10,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 12:00:10,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-04-11 12:00:10,603 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 16 states. [2018-04-11 12:00:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:10,650 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-04-11 12:00:10,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:00:10,651 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-04-11 12:00:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:10,651 INFO L225 Difference]: With dead ends: 107 [2018-04-11 12:00:10,651 INFO L226 Difference]: Without dead ends: 105 [2018-04-11 12:00:10,652 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 12:00:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-11 12:00:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-04-11 12:00:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 12:00:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-04-11 12:00:10,655 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 34 [2018-04-11 12:00:10,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:10,655 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-04-11 12:00:10,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 12:00:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-04-11 12:00:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 12:00:10,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:10,656 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 12:00:10,656 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 12:00:10,656 INFO L82 PathProgramCache]: Analyzing trace with hash 765270955, now seen corresponding path program 6 times [2018-04-11 12:00:10,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:10,657 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:10,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:10,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:00:10,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:10,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:10,759 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 12:00:10,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:00:10,759 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:00:10,764 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 12:00:10,804 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-11 12:00:10,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:00:10,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:00:10,858 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 12:00:10,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:00:10,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-11 12:00:10,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 12:00:10,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 12:00:10,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-04-11 12:00:10,877 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 18 states. [2018-04-11 12:00:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:10,916 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-04-11 12:00:10,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 12:00:10,918 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-04-11 12:00:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:10,918 INFO L225 Difference]: With dead ends: 108 [2018-04-11 12:00:10,919 INFO L226 Difference]: Without dead ends: 106 [2018-04-11 12:00:10,919 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 12:00:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-11 12:00:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-04-11 12:00:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 12:00:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-04-11 12:00:10,922 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 35 [2018-04-11 12:00:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:10,922 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-04-11 12:00:10,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 12:00:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-04-11 12:00:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 12:00:10,925 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:10,925 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 12:00:10,926 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 12:00:10,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1833679833, now seen corresponding path program 7 times [2018-04-11 12:00:10,926 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:10,926 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:10,927 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:10,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:00:10,927 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:10,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:11,030 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 12:00:11,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:00:11,030 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:00:11,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:00:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:11,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:00:11,118 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 12:00:11,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:00:11,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-11 12:00:11,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 12:00:11,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 12:00:11,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2018-04-11 12:00:11,136 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 20 states. [2018-04-11 12:00:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:11,168 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-04-11 12:00:11,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 12:00:11,168 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-04-11 12:00:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:11,169 INFO L225 Difference]: With dead ends: 109 [2018-04-11 12:00:11,169 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 12:00:11,170 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 12:00:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 12:00:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-04-11 12:00:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-11 12:00:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-04-11 12:00:11,173 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 36 [2018-04-11 12:00:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:11,173 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-04-11 12:00:11,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 12:00:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-04-11 12:00:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 12:00:11,174 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:11,174 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 12:00:11,174 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 12:00:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash 594616683, now seen corresponding path program 8 times [2018-04-11 12:00:11,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:11,174 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:11,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:11,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:00:11,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:11,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:11,276 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 12:00:11,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:00:11,277 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:00:11,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 12:00:11,316 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 12:00:11,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:00:11,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:00:11,374 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 12:00:11,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:00:11,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-04-11 12:00:11,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 12:00:11,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 12:00:11,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2018-04-11 12:00:11,393 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 22 states. [2018-04-11 12:00:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:11,429 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-04-11 12:00:11,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 12:00:11,429 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-04-11 12:00:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:11,430 INFO L225 Difference]: With dead ends: 110 [2018-04-11 12:00:11,430 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 12:00:11,431 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 12:00:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 12:00:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-11 12:00:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 12:00:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2018-04-11 12:00:11,433 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2018-04-11 12:00:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:11,433 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2018-04-11 12:00:11,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 12:00:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-04-11 12:00:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 12:00:11,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:11,434 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 12:00:11,435 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 12:00:11,435 INFO L82 PathProgramCache]: Analyzing trace with hash 838364697, now seen corresponding path program 9 times [2018-04-11 12:00:11,435 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:11,435 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:11,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:11,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:00:11,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:11,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:11,551 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 12:00:11,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:00:11,552 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:00:11,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 12:00:11,671 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-11 12:00:11,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:00:11,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:00:11,723 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 12:00:11,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:00:11,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-04-11 12:00:11,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 12:00:11,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 12:00:11,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2018-04-11 12:00:11,742 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 24 states. [2018-04-11 12:00:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:00:11,771 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-04-11 12:00:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 12:00:11,772 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 38 [2018-04-11 12:00:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:00:11,772 INFO L225 Difference]: With dead ends: 111 [2018-04-11 12:00:11,773 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 12:00:11,773 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 12:00:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 12:00:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-04-11 12:00:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-11 12:00:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2018-04-11 12:00:11,775 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 38 [2018-04-11 12:00:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:00:11,776 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2018-04-11 12:00:11,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 12:00:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2018-04-11 12:00:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 12:00:11,777 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:00:11,777 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 12:00:11,777 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 12:00:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash -195381461, now seen corresponding path program 10 times [2018-04-11 12:00:11,777 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:00:11,777 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:00:11,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:11,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:00:11,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:00:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:00:11,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:00:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:00:12,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:00:12,350 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:00:12,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 12:00:12,424 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 12:00:12,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:00:12,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:00:12,445 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 12:00:12,446 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 12:00:12,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 12:00:12,461 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 12:00:12,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,465 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 12:00:12,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 12:00:12,511 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 12:00:12,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,516 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 12:00:12,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-11 12:00:12,558 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 12:00:12,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,566 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 12:00:12,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-11 12:00:12,622 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 12:00:12,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,634 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 12:00:12,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-11 12:00:12,693 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 12:00:12,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,704 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 12:00:12,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-11 12:00:12,771 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 12:00:12,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,785 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 12:00:12,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-04-11 12:00:12,859 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 12:00:12,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:00:12,880 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 164 [2018-04-11 12:00:12,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:00:12,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-04-11 12:01:05,983 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-04-11 12:01:05,984 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:188) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:67) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:131) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:196) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:408) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 47 more [2018-04-11 12:01:05,986 INFO L168 Benchmark]: Toolchain (without parser) took 57892.88 ms. Allocated memory was 402.1 MB in the beginning and 738.2 MB in the end (delta: 336.1 MB). Free memory was 339.8 MB in the beginning and 610.5 MB in the end (delta: -270.7 MB). Peak memory consumption was 65.3 MB. Max. memory is 5.3 GB. [2018-04-11 12:01:05,987 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 402.1 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 12:01:05,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.62 ms. Allocated memory is still 402.1 MB. Free memory was 339.8 MB in the beginning and 329.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-11 12:01:05,987 INFO L168 Benchmark]: Boogie Preprocessor took 29.45 ms. Allocated memory is still 402.1 MB. Free memory was 329.2 MB in the beginning and 326.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 12:01:05,988 INFO L168 Benchmark]: RCFGBuilder took 369.78 ms. Allocated memory was 402.1 MB in the beginning and 613.9 MB in the end (delta: 211.8 MB). Free memory was 326.5 MB in the beginning and 561.4 MB in the end (delta: -234.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-11 12:01:05,988 INFO L168 Benchmark]: TraceAbstraction took 57330.57 ms. Allocated memory was 613.9 MB in the beginning and 738.2 MB in the end (delta: 124.3 MB). Free memory was 561.4 MB in the beginning and 610.5 MB in the end (delta: -49.1 MB). Peak memory consumption was 75.1 MB. Max. memory is 5.3 GB. [2018-04-11 12:01:05,989 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.14 ms. Allocated memory is still 402.1 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.62 ms. Allocated memory is still 402.1 MB. Free memory was 339.8 MB in the beginning and 329.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.45 ms. Allocated memory is still 402.1 MB. Free memory was 329.2 MB in the beginning and 326.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 369.78 ms. Allocated memory was 402.1 MB in the beginning and 613.9 MB in the end (delta: 211.8 MB). Free memory was 326.5 MB in the beginning and 561.4 MB in the end (delta: -234.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57330.57 ms. Allocated memory was 613.9 MB in the beginning and 738.2 MB in the end (delta: 124.3 MB). Free memory was 561.4 MB in the beginning and 610.5 MB in the end (delta: -49.1 MB). Peak memory consumption was 75.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_12-01-05-993.csv Received shutdown request...