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_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 16:50:25,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 16:50:25,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 16:50:25,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 16:50:25,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 16:50:25,851 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 16:50:25,851 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 16:50:25,853 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 16:50:25,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 16:50:25,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 16:50:25,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 16:50:25,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 16:50:25,857 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 16:50:25,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 16:50:25,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 16:50:25,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 16:50:25,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 16:50:25,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 16:50:25,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 16:50:25,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 16:50:25,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 16:50:25,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 16:50:25,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 16:50:25,868 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 16:50:25,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 16:50:25,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 16:50:25,870 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 16:50:25,870 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 16:50:25,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 16:50:25,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 16:50:25,871 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 16:50:25,872 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-12 16:50:25,880 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 16:50:25,880 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 16:50:25,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 16:50:25,881 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 16:50:25,881 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 16:50:25,882 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 16:50:25,882 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 16:50:25,882 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 16:50:25,882 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 16:50:25,882 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 16:50:25,882 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 16:50:25,882 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 16:50:25,883 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 16:50:25,883 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 16:50:25,883 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 16:50:25,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 16:50:25,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 16:50:25,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 16:50:25,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 16:50:25,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 16:50:25,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 16:50:25,884 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 16:50:25,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 16:50:25,884 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 16:50:25,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 16:50:25,918 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 16:50:25,921 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 16:50:25,922 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 16:50:25,922 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 16:50:25,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_false-valid-deref.i [2018-04-12 16:50:26,195 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf6ee466fc [2018-04-12 16:50:26,303 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 16:50:26,303 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 16:50:26,303 INFO L168 CDTParser]: Scanning test-bitfields-3_false-valid-deref.i [2018-04-12 16:50:26,304 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 16:50:26,304 INFO L215 ultiparseSymbolTable]: [2018-04-12 16:50:26,304 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 16:50:26,304 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_false-valid-deref.i [2018-04-12 16:50:26,304 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 16:50:26,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-3_false-valid-deref.i [2018-04-12 16:50:26,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-3_false-valid-deref.i [2018-04-12 16:50:26,319 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf6ee466fc [2018-04-12 16:50:26,323 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 16:50:26,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 16:50:26,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 16:50:26,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 16:50:26,332 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 16:50:26,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 04:50:26" (1/1) ... [2018-04-12 16:50:26,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5191513f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:50:26, skipping insertion in model container [2018-04-12 16:50:26,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 04:50:26" (1/1) ... [2018-04-12 16:50:26,350 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 16:50:26,361 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 16:50:26,479 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 16:50:26,504 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 16:50:26,510 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-12 16:50:26,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:50:26 WrapperNode [2018-04-12 16:50:26,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 16:50:26,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 16:50:26,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 16:50:26,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 16:50:26,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:50:26" (1/1) ... [2018-04-12 16:50:26,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:50:26" (1/1) ... [2018-04-12 16:50:26,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:50:26" (1/1) ... [2018-04-12 16:50:26,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:50:26" (1/1) ... [2018-04-12 16:50:26,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:50:26" (1/1) ... [2018-04-12 16:50:26,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:50:26" (1/1) ... [2018-04-12 16:50:26,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:50:26" (1/1) ... [2018-04-12 16:50:26,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 16:50:26,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 16:50:26,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 16:50:26,553 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 16:50:26,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:50:26" (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-12 16:50:26,592 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 16:50:26,592 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 16:50:26,592 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 16:50:26,592 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-12 16:50:26,592 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-12 16:50:26,592 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 16:50:26,592 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 16:50:26,592 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 16:50:26,592 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 16:50:26,592 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-12 16:50:26,592 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 16:50:26,592 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 16:50:26,593 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 16:50:26,593 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 16:50:26,593 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 16:50:26,593 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 16:50:26,959 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-12 16:50:26,966 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 16:50:26,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 04:50:26 BoogieIcfgContainer [2018-04-12 16:50:26,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 16:50:26,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 16:50:26,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 16:50:26,969 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 16:50:26,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 04:50:26" (1/3) ... [2018-04-12 16:50:26,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e59e40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 04:50:26, skipping insertion in model container [2018-04-12 16:50:26,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 04:50:26" (2/3) ... [2018-04-12 16:50:26,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e59e40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 04:50:26, skipping insertion in model container [2018-04-12 16:50:26,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 04:50:26" (3/3) ... [2018-04-12 16:50:26,972 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_false-valid-deref.i [2018-04-12 16:50:26,980 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 16:50:26,986 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-12 16:50:27,016 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 16:50:27,017 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 16:50:27,017 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 16:50:27,017 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 16:50:27,017 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 16:50:27,017 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 16:50:27,017 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 16:50:27,017 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 16:50:27,017 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 16:50:27,018 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 16:50:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-04-12 16:50:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 16:50:27,032 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:27,032 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 16:50:27,032 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-12 16:50:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash -383275974, now seen corresponding path program 1 times [2018-04-12 16:50:27,036 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:27,036 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:27,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 16:50:27,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:27,102 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:27,152 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-12 16:50:27,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 16:50:27,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 16:50:27,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 16:50:27,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 16:50:27,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 16:50:27,170 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 4 states. [2018-04-12 16:50:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:27,394 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-04-12 16:50:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 16:50:27,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-12 16:50:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:27,403 INFO L225 Difference]: With dead ends: 202 [2018-04-12 16:50:27,403 INFO L226 Difference]: Without dead ends: 199 [2018-04-12 16:50:27,404 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-12 16:50:27,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-12 16:50:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2018-04-12 16:50:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-12 16:50:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-04-12 16:50:27,432 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 17 [2018-04-12 16:50:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:27,433 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-04-12 16:50:27,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 16:50:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-04-12 16:50:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 16:50:27,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:27,434 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 16:50:27,434 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-12 16:50:27,434 INFO L82 PathProgramCache]: Analyzing trace with hash -383275973, now seen corresponding path program 1 times [2018-04-12 16:50:27,435 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:27,435 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:27,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 16:50:27,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:27,451 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:27,476 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-12 16:50:27,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 16:50:27,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 16:50:27,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 16:50:27,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 16:50:27,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 16:50:27,478 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 3 states. [2018-04-12 16:50:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:27,558 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-04-12 16:50:27,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 16:50:27,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-12 16:50:27,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:27,559 INFO L225 Difference]: With dead ends: 188 [2018-04-12 16:50:27,559 INFO L226 Difference]: Without dead ends: 188 [2018-04-12 16:50:27,560 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-12 16:50:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-12 16:50:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 122. [2018-04-12 16:50:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-12 16:50:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-04-12 16:50:27,565 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 17 [2018-04-12 16:50:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:27,566 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-04-12 16:50:27,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 16:50:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-04-12 16:50:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 16:50:27,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:27,566 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 16:50:27,566 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-12 16:50:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash -383275972, now seen corresponding path program 1 times [2018-04-12 16:50:27,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:27,567 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:27,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 16:50:27,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:27,583 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:27,617 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-12 16:50:27,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 16:50:27,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 16:50:27,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 16:50:27,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 16:50:27,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 16:50:27,619 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 4 states. [2018-04-12 16:50:27,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:27,728 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-12 16:50:27,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 16:50:27,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-12 16:50:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:27,729 INFO L225 Difference]: With dead ends: 100 [2018-04-12 16:50:27,729 INFO L226 Difference]: Without dead ends: 100 [2018-04-12 16:50:27,729 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-12 16:50:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-12 16:50:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-12 16:50:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-12 16:50:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-12 16:50:27,733 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 17 [2018-04-12 16:50:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:27,733 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-12 16:50:27,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 16:50:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-12 16:50:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 16:50:27,733 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:27,733 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 16:50:27,733 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-12 16:50:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash -383275971, now seen corresponding path program 1 times [2018-04-12 16:50:27,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:27,734 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:27,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 16:50:27,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:27,741 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:27,785 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-12 16:50:27,785 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 16:50:27,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 16:50:27,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 16:50:27,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 16:50:27,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 16:50:27,786 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 3 states. [2018-04-12 16:50:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:27,809 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-04-12 16:50:27,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 16:50:27,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-04-12 16:50:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:27,810 INFO L225 Difference]: With dead ends: 99 [2018-04-12 16:50:27,810 INFO L226 Difference]: Without dead ends: 99 [2018-04-12 16:50:27,811 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-12 16:50:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-12 16:50:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-04-12 16:50:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-12 16:50:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-04-12 16:50:27,816 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 17 [2018-04-12 16:50:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:27,816 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-04-12 16:50:27,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 16:50:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-04-12 16:50:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 16:50:27,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:27,817 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-12 16:50:27,817 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-12 16:50:27,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1560963691, now seen corresponding path program 1 times [2018-04-12 16:50:27,817 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:27,818 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:27,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 16:50:27,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:27,834 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:27,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-12 16:50:27,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 16:50:27,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 16:50:27,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 16:50:27,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 16:50:27,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-12 16:50:27,856 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2018-04-12 16:50:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:27,865 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-04-12 16:50:27,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 16:50:27,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-12 16:50:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:27,866 INFO L225 Difference]: With dead ends: 102 [2018-04-12 16:50:27,866 INFO L226 Difference]: Without dead ends: 100 [2018-04-12 16:50:27,866 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-12 16:50:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-12 16:50:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-12 16:50:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-12 16:50:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-12 16:50:27,871 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 29 [2018-04-12 16:50:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:27,871 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-12 16:50:27,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 16:50:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-12 16:50:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 16:50:27,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:27,872 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-12 16:50:27,872 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-12 16:50:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash 730350873, now seen corresponding path program 1 times [2018-04-12 16:50:27,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:27,872 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:27,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 16:50:27,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:27,885 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:27,909 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-12 16:50:27,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 16:50:27,910 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-12 16:50:27,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 16:50:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:27,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 16:50:27,962 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-12 16:50:27,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 16:50:27,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-12 16:50:27,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 16:50:27,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 16:50:27,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 16:50:27,988 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 8 states. [2018-04-12 16:50:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:28,033 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-04-12 16:50:28,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 16:50:28,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-04-12 16:50:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:28,034 INFO L225 Difference]: With dead ends: 103 [2018-04-12 16:50:28,034 INFO L226 Difference]: Without dead ends: 101 [2018-04-12 16:50:28,035 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-12 16:50:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-12 16:50:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-04-12 16:50:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-12 16:50:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-04-12 16:50:28,039 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 30 [2018-04-12 16:50:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:28,039 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-04-12 16:50:28,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 16:50:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-04-12 16:50:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 16:50:28,040 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:28,040 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-12 16:50:28,040 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-12 16:50:28,041 INFO L82 PathProgramCache]: Analyzing trace with hash 751157291, now seen corresponding path program 2 times [2018-04-12 16:50:28,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:28,041 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:28,042 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:28,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 16:50:28,042 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:28,056 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:28,091 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-12 16:50:28,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 16:50:28,091 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-12 16:50:28,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 16:50:28,127 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 16:50:28,128 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 16:50:28,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 16:50:28,162 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-12 16:50:28,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 16:50:28,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-12 16:50:28,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 16:50:28,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 16:50:28,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-12 16:50:28,191 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 10 states. [2018-04-12 16:50:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:28,224 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-04-12 16:50:28,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 16:50:28,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-04-12 16:50:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:28,225 INFO L225 Difference]: With dead ends: 104 [2018-04-12 16:50:28,225 INFO L226 Difference]: Without dead ends: 102 [2018-04-12 16:50:28,225 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-12 16:50:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-12 16:50:28,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-04-12 16:50:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-12 16:50:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-04-12 16:50:28,228 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 31 [2018-04-12 16:50:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:28,228 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-04-12 16:50:28,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 16:50:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-04-12 16:50:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 16:50:28,229 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:28,229 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-12 16:50:28,229 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-12 16:50:28,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1396156249, now seen corresponding path program 3 times [2018-04-12 16:50:28,230 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:28,230 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:28,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:28,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 16:50:28,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:28,245 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:28,294 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-12 16:50:28,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 16:50:28,294 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-12 16:50:28,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 16:50:28,333 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-12 16:50:28,333 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 16:50:28,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 16:50:28,359 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-12 16:50:28,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 16:50:28,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-12 16:50:28,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 16:50:28,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 16:50:28,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-12 16:50:28,379 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 12 states. [2018-04-12 16:50:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:28,405 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-04-12 16:50:28,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 16:50:28,415 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-04-12 16:50:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:28,415 INFO L225 Difference]: With dead ends: 105 [2018-04-12 16:50:28,415 INFO L226 Difference]: Without dead ends: 103 [2018-04-12 16:50:28,416 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-12 16:50:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-12 16:50:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-04-12 16:50:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-12 16:50:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-04-12 16:50:28,419 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 32 [2018-04-12 16:50:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:28,419 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-04-12 16:50:28,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 16:50:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-04-12 16:50:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 16:50:28,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:28,420 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-12 16:50:28,420 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-12 16:50:28,420 INFO L82 PathProgramCache]: Analyzing trace with hash -83712533, now seen corresponding path program 4 times [2018-04-12 16:50:28,420 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:28,420 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:28,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:28,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 16:50:28,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:28,435 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:28,499 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-12 16:50:28,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 16:50:28,500 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-12 16:50:28,508 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-12 16:50:28,526 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-12 16:50:28,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 16:50:28,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 16:50:28,617 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-12 16:50:28,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 16:50:28,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-04-12 16:50:28,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 16:50:28,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 16:50:28,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-04-12 16:50:28,642 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 14 states. [2018-04-12 16:50:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:28,663 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-04-12 16:50:28,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 16:50:28,663 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-12 16:50:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:28,664 INFO L225 Difference]: With dead ends: 106 [2018-04-12 16:50:28,664 INFO L226 Difference]: Without dead ends: 104 [2018-04-12 16:50:28,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-04-12 16:50:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-12 16:50:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-12 16:50:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-12 16:50:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-04-12 16:50:28,668 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 33 [2018-04-12 16:50:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:28,668 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-04-12 16:50:28,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 16:50:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-04-12 16:50:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-12 16:50:28,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:28,669 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-12 16:50:28,669 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-12 16:50:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1284995481, now seen corresponding path program 5 times [2018-04-12 16:50:28,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:28,669 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:28,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:28,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 16:50:28,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:28,683 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:28,737 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-12 16:50:28,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 16:50:28,738 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-12 16:50:28,746 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-12 16:50:28,771 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-12 16:50:28,772 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 16:50:28,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 16:50:28,808 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-12 16:50:28,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 16:50:28,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-12 16:50:28,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 16:50:28,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 16:50:28,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-04-12 16:50:28,827 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 16 states. [2018-04-12 16:50:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:28,861 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-04-12 16:50:28,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 16:50:28,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-04-12 16:50:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:28,863 INFO L225 Difference]: With dead ends: 107 [2018-04-12 16:50:28,863 INFO L226 Difference]: Without dead ends: 105 [2018-04-12 16:50:28,863 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-12 16:50:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-12 16:50:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-04-12 16:50:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-12 16:50:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-04-12 16:50:28,866 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 34 [2018-04-12 16:50:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:28,866 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-04-12 16:50:28,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 16:50:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-04-12 16:50:28,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-12 16:50:28,867 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:28,867 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-12 16:50:28,867 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-12 16:50:28,867 INFO L82 PathProgramCache]: Analyzing trace with hash 765270955, now seen corresponding path program 6 times [2018-04-12 16:50:28,868 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:28,868 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:28,868 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:28,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 16:50:28,868 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:28,881 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:28,951 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-12 16:50:28,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 16:50:28,952 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-12 16:50:28,957 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-12 16:50:29,004 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-12 16:50:29,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 16:50:29,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 16:50:29,043 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-12 16:50:29,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 16:50:29,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-12 16:50:29,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 16:50:29,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 16:50:29,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-04-12 16:50:29,067 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 18 states. [2018-04-12 16:50:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:29,093 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-04-12 16:50:29,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 16:50:29,094 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-04-12 16:50:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:29,095 INFO L225 Difference]: With dead ends: 108 [2018-04-12 16:50:29,095 INFO L226 Difference]: Without dead ends: 106 [2018-04-12 16:50:29,095 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-12 16:50:29,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-12 16:50:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-04-12 16:50:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-12 16:50:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-04-12 16:50:29,098 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 35 [2018-04-12 16:50:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:29,098 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-04-12 16:50:29,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 16:50:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-04-12 16:50:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-12 16:50:29,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:29,099 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-12 16:50:29,099 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-12 16:50:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1833679833, now seen corresponding path program 7 times [2018-04-12 16:50:29,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:29,099 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:29,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:29,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 16:50:29,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:29,117 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:29,198 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-12 16:50:29,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 16:50:29,198 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-12 16:50:29,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 16:50:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:29,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 16:50:29,267 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-12 16:50:29,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 16:50:29,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-12 16:50:29,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 16:50:29,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 16:50:29,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2018-04-12 16:50:29,285 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 20 states. [2018-04-12 16:50:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:29,315 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-04-12 16:50:29,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 16:50:29,316 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-04-12 16:50:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:29,317 INFO L225 Difference]: With dead ends: 109 [2018-04-12 16:50:29,317 INFO L226 Difference]: Without dead ends: 107 [2018-04-12 16:50:29,317 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-12 16:50:29,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-12 16:50:29,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-04-12 16:50:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-12 16:50:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-04-12 16:50:29,318 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 36 [2018-04-12 16:50:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:29,319 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-04-12 16:50:29,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 16:50:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-04-12 16:50:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-12 16:50:29,319 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:29,319 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-12 16:50:29,319 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-12 16:50:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash 594616683, now seen corresponding path program 8 times [2018-04-12 16:50:29,319 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:29,319 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:29,320 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:29,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 16:50:29,320 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:29,332 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:29,408 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-12 16:50:29,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 16:50:29,408 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-12 16:50:29,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 16:50:29,435 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 16:50:29,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 16:50:29,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 16:50:29,488 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-12 16:50:29,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 16:50:29,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-04-12 16:50:29,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 16:50:29,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 16:50:29,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2018-04-12 16:50:29,506 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 22 states. [2018-04-12 16:50:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:29,537 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-04-12 16:50:29,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 16:50:29,537 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-04-12 16:50:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:29,538 INFO L225 Difference]: With dead ends: 110 [2018-04-12 16:50:29,538 INFO L226 Difference]: Without dead ends: 108 [2018-04-12 16:50:29,538 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-12 16:50:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-12 16:50:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-12 16:50:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-12 16:50:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2018-04-12 16:50:29,540 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2018-04-12 16:50:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:29,540 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2018-04-12 16:50:29,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 16:50:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2018-04-12 16:50:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 16:50:29,541 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:29,541 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-12 16:50:29,541 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-12 16:50:29,541 INFO L82 PathProgramCache]: Analyzing trace with hash 838364697, now seen corresponding path program 9 times [2018-04-12 16:50:29,541 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:29,541 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:29,542 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:29,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 16:50:29,542 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:29,554 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:29,627 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-12 16:50:29,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 16:50:29,627 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-12 16:50:29,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 16:50:29,759 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-12 16:50:29,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 16:50:29,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 16:50:29,806 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-12 16:50:29,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 16:50:29,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-04-12 16:50:29,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 16:50:29,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 16:50:29,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2018-04-12 16:50:29,823 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 24 states. [2018-04-12 16:50:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 16:50:29,861 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-04-12 16:50:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 16:50:29,861 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 38 [2018-04-12 16:50:29,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 16:50:29,862 INFO L225 Difference]: With dead ends: 111 [2018-04-12 16:50:29,862 INFO L226 Difference]: Without dead ends: 109 [2018-04-12 16:50:29,862 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-12 16:50:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-12 16:50:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-04-12 16:50:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-12 16:50:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2018-04-12 16:50:29,864 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 38 [2018-04-12 16:50:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 16:50:29,864 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2018-04-12 16:50:29,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 16:50:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2018-04-12 16:50:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-12 16:50:29,865 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 16:50:29,865 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-12 16:50:29,865 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-12 16:50:29,865 INFO L82 PathProgramCache]: Analyzing trace with hash -195381461, now seen corresponding path program 10 times [2018-04-12 16:50:29,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 16:50:29,866 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 16:50:29,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:29,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 16:50:29,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 16:50:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 16:50:29,921 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 16:50:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 16:50:30,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 16:50:30,329 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-12 16:50:30,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-12 16:50:30,400 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-12 16:50:30,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 16:50:30,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 16:50:30,420 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-12 16:50:30,421 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-12 16:50:30,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-12 16:50:30,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 21 treesize of output 16 [2018-04-12 16:50:30,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,449 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-12 16:50:30,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-12 16:50:30,475 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-12 16:50:30,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,488 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-12 16:50:30,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-12 16:50:30,521 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-12 16:50:30,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,527 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-12 16:50:30,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-12 16:50:30,569 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-12 16:50:30,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,583 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-12 16:50:30,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-12 16:50:30,668 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-12 16:50:30,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,682 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-12 16:50:30,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-12 16:50:30,746 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-12 16:50:30,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,771 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-12 16:50:30,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-04-12 16:50:30,846 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-12 16:50:30,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:50:30,858 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-12 16:50:30,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:50:30,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-04-12 16:50:45,356 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-12 16:53:39,690 WARN L151 SmtUtils]: Spent 174041ms on a formula simplification. DAG size of input: 3679 DAG size of output 137 [2018-04-12 16:53:39,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:39,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:39,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:39,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:39,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:39,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:39,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:39,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:39,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:39,836 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:53:39,837 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:53:39,843 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:53:39,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:53:39,845 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:53:39,874 INFO L303 Elim1Store]: Index analysis took 182 ms [2018-04-12 16:53:39,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 10750 treesize of output 1908 [2018-04-12 16:53:39,907 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:53:39,945 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:53:39,984 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:53:39,984 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:53:39,985 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:53:40,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:40,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:53:42,814 INFO L303 Elim1Store]: Index analysis took 2930 ms [2018-04-12 16:53:43,203 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 47 disjoint index pairs (out of 120 index pairs), introduced 11 new quantified variables, introduced 30 case distinctions, treesize of input 1902 treesize of output 1990 [2018-04-12 16:53:43,203 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-12 16:53:43,261 INFO L267 ElimStorePlain]: Start of recursive call 3: 54 dim-0 vars, End of recursive call: 54 dim-0 vars, and 27 xjuncts. [2018-04-12 16:54:12,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 800 treesize of output 723 [2018-04-12 16:54:14,128 WARN L151 SmtUtils]: Spent 1573ms on a formula simplification. DAG size of input: 111 DAG size of output 97 [2018-04-12 16:54:14,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,165 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:54:14,165 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:54:14,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 713 treesize of output 673 [2018-04-12 16:54:14,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 365 treesize of output 431 [2018-04-12 16:54:14,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,334 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:54:14,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 546 [2018-04-12 16:54:14,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,497 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:54:14,498 INFO L303 Elim1Store]: Index analysis took 158 ms [2018-04-12 16:54:14,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 26 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 426 treesize of output 694 [2018-04-12 16:54:14,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,708 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:54:14,708 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:54:14,709 INFO L303 Elim1Store]: Index analysis took 205 ms [2018-04-12 16:54:14,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 484 treesize of output 940 [2018-04-12 16:54:14,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:14,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,037 INFO L303 Elim1Store]: Index analysis took 322 ms [2018-04-12 16:54:15,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 35 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 575 treesize of output 990 [2018-04-12 16:54:15,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,262 INFO L303 Elim1Store]: Index analysis took 215 ms [2018-04-12 16:54:15,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 43 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 577 treesize of output 1083 [2018-04-12 16:54:15,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,651 INFO L303 Elim1Store]: Index analysis took 382 ms [2018-04-12 16:54:15,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 52 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 579 treesize of output 1184 [2018-04-12 16:54:15,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:15,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 16:54:16,036 INFO L303 Elim1Store]: Index analysis took 378 ms [2018-04-12 16:54:16,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 62 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 581 treesize of output 1322 [2018-04-12 16:54:16,038 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 16:54:16,300 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:54:16,457 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:54:16,571 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:54:16,681 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:54:16,782 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:54:16,874 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:54:16,944 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:54:17,050 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:54:17,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 16:54:17,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 137 [2018-04-12 16:54:17,264 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 16:54:17,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 787 treesize of output 712 [2018-04-12 16:54:17,715 WARN L151 SmtUtils]: Spent 335ms on a formula simplification. DAG size of input: 95 DAG size of output 89 [2018-04-12 16:54:17,720 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:54:17,720 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 16:54:17,722 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_15 term size 92 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) 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) [2018-04-12 16:54:17,724 INFO L168 Benchmark]: Toolchain (without parser) took 231400.85 ms. Allocated memory was 394.8 MB in the beginning and 681.1 MB in the end (delta: 286.3 MB). Free memory was 337.0 MB in the beginning and 544.9 MB in the end (delta: -207.9 MB). Peak memory consumption was 268.9 MB. Max. memory is 5.3 GB. [2018-04-12 16:54:17,725 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 394.8 MB. Free memory is still 358.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 16:54:17,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.82 ms. Allocated memory is still 394.8 MB. Free memory was 337.0 MB in the beginning and 326.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-04-12 16:54:17,726 INFO L168 Benchmark]: Boogie Preprocessor took 32.08 ms. Allocated memory is still 394.8 MB. Free memory was 326.3 MB in the beginning and 323.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-04-12 16:54:17,726 INFO L168 Benchmark]: RCFGBuilder took 413.92 ms. Allocated memory was 394.8 MB in the beginning and 585.6 MB in the end (delta: 190.8 MB). Free memory was 323.5 MB in the beginning and 534.5 MB in the end (delta: -211.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-04-12 16:54:17,726 INFO L168 Benchmark]: TraceAbstraction took 230756.84 ms. Allocated memory was 585.6 MB in the beginning and 681.1 MB in the end (delta: 95.4 MB). Free memory was 534.5 MB in the beginning and 544.9 MB in the end (delta: -10.4 MB). Peak memory consumption was 275.6 MB. Max. memory is 5.3 GB. [2018-04-12 16:54:17,728 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 394.8 MB. Free memory is still 358.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.82 ms. Allocated memory is still 394.8 MB. Free memory was 337.0 MB in the beginning and 326.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.08 ms. Allocated memory is still 394.8 MB. Free memory was 326.3 MB in the beginning and 323.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 413.92 ms. Allocated memory was 394.8 MB in the beginning and 585.6 MB in the end (delta: 190.8 MB). Free memory was 323.5 MB in the beginning and 534.5 MB in the end (delta: -211.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 230756.84 ms. Allocated memory was 585.6 MB in the beginning and 681.1 MB in the end (delta: 95.4 MB). Free memory was 534.5 MB in the beginning and 544.9 MB in the end (delta: -10.4 MB). Peak memory consumption was 275.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_15 term size 92 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_15 term size 92: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_16-54-17-734.csv [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...