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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 22:21:01,242 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 22:21:01,244 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 22:21:01,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 22:21:01,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 22:21:01,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 22:21:01,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 22:21:01,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 22:21:01,266 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 22:21:01,267 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 22:21:01,267 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 22:21:01,268 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 22:21:01,269 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 22:21:01,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 22:21:01,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 22:21:01,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 22:21:01,275 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 22:21:01,277 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 22:21:01,278 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 22:21:01,279 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 22:21:01,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 22:21:01,282 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 22:21:01,282 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 22:21:01,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 22:21:01,284 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 22:21:01,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 22:21:01,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 22:21:01,286 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 22:21:01,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 22:21:01,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 22:21:01,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 22:21:01,288 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 22:21:01,312 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 22:21:01,312 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 22:21:01,313 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 22:21:01,313 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 22:21:01,314 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 22:21:01,314 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 22:21:01,314 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 22:21:01,314 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 22:21:01,314 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 22:21:01,315 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 22:21:01,315 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 22:21:01,315 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 22:21:01,315 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 22:21:01,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 22:21:01,316 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 22:21:01,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 22:21:01,316 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 22:21:01,316 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 22:21:01,316 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 22:21:01,317 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 22:21:01,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 22:21:01,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 22:21:01,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 22:21:01,317 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 22:21:01,318 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 22:21:01,318 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 22:21:01,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 22:21:01,318 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 22:21:01,318 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 22:21:01,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 22:21:01,319 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 22:21:01,319 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 22:21:01,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:21:01,319 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 22:21:01,320 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 22:21:01,320 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 22:21:01,321 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 22:21:01,321 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 22:21:01,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 22:21:01,367 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 22:21:01,371 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 22:21:01,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 22:21:01,373 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 22:21:01,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i [2018-04-09 22:21:01,715 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG623abcd9e [2018-04-09 22:21:01,835 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 22:21:01,836 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 22:21:01,836 INFO L168 CDTParser]: Scanning test-bitfields-2_false-valid-deref.i [2018-04-09 22:21:01,837 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 22:21:01,837 INFO L215 ultiparseSymbolTable]: [2018-04-09 22:21:01,837 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 22:21:01,837 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_false-valid-deref.i [2018-04-09 22:21:01,837 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 22:21:01,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-2_false-valid-deref.i [2018-04-09 22:21:01,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-2_false-valid-deref.i [2018-04-09 22:21:01,852 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG623abcd9e [2018-04-09 22:21:01,857 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 22:21:01,859 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 22:21:01,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 22:21:01,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 22:21:01,865 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 22:21:01,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:21:01" (1/1) ... [2018-04-09 22:21:01,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633dd61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:21:01, skipping insertion in model container [2018-04-09 22:21:01,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:21:01" (1/1) ... [2018-04-09 22:21:01,882 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:21:01,894 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:21:02,020 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:21:02,045 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:21:02,051 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-09 22:21:02,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:21:02 WrapperNode [2018-04-09 22:21:02,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 22:21:02,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 22:21:02,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 22:21:02,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 22:21:02,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:21:02" (1/1) ... [2018-04-09 22:21:02,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:21:02" (1/1) ... [2018-04-09 22:21:02,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:21:02" (1/1) ... [2018-04-09 22:21:02,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:21:02" (1/1) ... [2018-04-09 22:21:02,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:21:02" (1/1) ... [2018-04-09 22:21:02,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:21:02" (1/1) ... [2018-04-09 22:21:02,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:21:02" (1/1) ... [2018-04-09 22:21:02,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 22:21:02,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 22:21:02,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 22:21:02,097 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 22:21:02,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:21:02" (1/1) ... No working directory specified, using /storage/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-09 22:21:02,159 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 22:21:02,159 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 22:21:02,159 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 22:21:02,159 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-09 22:21:02,159 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-09 22:21:02,159 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 22:21:02,159 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 22:21:02,160 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 22:21:02,160 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 22:21:02,160 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-09 22:21:02,160 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 22:21:02,160 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 22:21:02,161 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 22:21:02,161 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 22:21:02,161 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 22:21:02,161 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 22:21:02,530 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-09 22:21:02,570 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 22:21:02,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:21:02 BoogieIcfgContainer [2018-04-09 22:21:02,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 22:21:02,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 22:21:02,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 22:21:02,574 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 22:21:02,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 10:21:01" (1/3) ... [2018-04-09 22:21:02,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3157db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:21:02, skipping insertion in model container [2018-04-09 22:21:02,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:21:02" (2/3) ... [2018-04-09 22:21:02,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3157db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:21:02, skipping insertion in model container [2018-04-09 22:21:02,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:21:02" (3/3) ... [2018-04-09 22:21:02,577 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_false-valid-deref.i [2018-04-09 22:21:02,583 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 22:21:02,589 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-04-09 22:21:02,637 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 22:21:02,637 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 22:21:02,637 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 22:21:02,638 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 22:21:02,638 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 22:21:02,638 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 22:21:02,638 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 22:21:02,638 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 22:21:02,638 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 22:21:02,639 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 22:21:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-04-09 22:21:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-09 22:21:02,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:21:02,657 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:21:02,657 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-09 22:21:02,661 INFO L82 PathProgramCache]: Analyzing trace with hash -506314848, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:21:02,672 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:21:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:21:02,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:21:02,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:21:02,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:02,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:02,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:21:02,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 22:21:02,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:02,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:21:02,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-09 22:21:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:21:02,823 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:21:02,878 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-09 22:21:02,904 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:21:02,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 22:21:02,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 22:21:02,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 22:21:02,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 22:21:02,920 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-04-09 22:21:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:21:03,081 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-04-09 22:21:03,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 22:21:03,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-09 22:21:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:21:03,095 INFO L225 Difference]: With dead ends: 160 [2018-04-09 22:21:03,095 INFO L226 Difference]: Without dead ends: 151 [2018-04-09 22:21:03,098 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 22:21:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-09 22:21:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 102. [2018-04-09 22:21:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-09 22:21:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-04-09 22:21:03,137 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 16 [2018-04-09 22:21:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:21:03,137 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-04-09 22:21:03,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 22:21:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-04-09 22:21:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-09 22:21:03,138 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:21:03,139 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:21:03,139 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-09 22:21:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash -506314847, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:21:03,146 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:21:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:21:03,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:21:03,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:21:03,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:03,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:03,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:21:03,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 22:21:03,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:03,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:21:03,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-09 22:21:03,212 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-09 22:21:03,212 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:21:03,580 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-09 22:21:03,601 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:21:03,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-04-09 22:21:03,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 22:21:03,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 22:21:03,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-09 22:21:03,604 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 5 states. [2018-04-09 22:21:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:21:03,678 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-04-09 22:21:03,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 22:21:03,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-09 22:21:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:21:03,680 INFO L225 Difference]: With dead ends: 102 [2018-04-09 22:21:03,680 INFO L226 Difference]: Without dead ends: 96 [2018-04-09 22:21:03,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-09 22:21:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-09 22:21:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-04-09 22:21:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-09 22:21:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-04-09 22:21:03,691 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 16 [2018-04-09 22:21:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:21:03,692 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-04-09 22:21:03,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 22:21:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-04-09 22:21:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 22:21:03,693 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:21:03,693 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] [2018-04-09 22:21:03,693 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-09 22:21:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash 51854364, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:21:03,708 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:21:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:21:03,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:21:03,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:21:03,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:03,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:03,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:21:03,778 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-09 22:21:03,778 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:21:03,812 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-09 22:21:03,846 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:21:03,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 22:21:03,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:21:03,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:21:03,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:21:03,847 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 6 states. [2018-04-09 22:21:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:21:03,970 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-04-09 22:21:03,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 22:21:03,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-09 22:21:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:21:03,972 INFO L225 Difference]: With dead ends: 96 [2018-04-09 22:21:03,972 INFO L226 Difference]: Without dead ends: 84 [2018-04-09 22:21:03,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:21:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-09 22:21:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-09 22:21:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-09 22:21:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-09 22:21:03,981 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 21 [2018-04-09 22:21:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:21:03,982 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-09 22:21:03,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:21:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-09 22:21:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 22:21:03,983 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:21:03,983 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] [2018-04-09 22:21:03,983 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-09 22:21:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash 51854362, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:21:03,991 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:21:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:21:04,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:21:04,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:21:04,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:21:04,020 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-09 22:21:04,021 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:21:04,026 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-09 22:21:04,049 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:21:04,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 22:21:04,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 22:21:04,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 22:21:04,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 22:21:04,050 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 4 states. [2018-04-09 22:21:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:21:04,149 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2018-04-09 22:21:04,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:21:04,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-09 22:21:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:21:04,150 INFO L225 Difference]: With dead ends: 126 [2018-04-09 22:21:04,150 INFO L226 Difference]: Without dead ends: 114 [2018-04-09 22:21:04,151 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-09 22:21:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-09 22:21:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2018-04-09 22:21:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-09 22:21:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-09 22:21:04,159 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-04-09 22:21:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:21:04,159 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-09 22:21:04,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 22:21:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-09 22:21:04,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-09 22:21:04,161 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:21:04,161 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:21:04,161 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-09 22:21:04,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2075956322, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:21:04,167 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:21:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:21:04,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:21:04,205 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-09 22:21:04,205 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:21:04,232 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-09 22:21:04,252 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:21:04,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 22:21:04,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:21:04,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:21:04,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:21:04,253 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 6 states. [2018-04-09 22:21:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:21:04,287 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-04-09 22:21:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 22:21:04,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-04-09 22:21:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:21:04,289 INFO L225 Difference]: With dead ends: 143 [2018-04-09 22:21:04,289 INFO L226 Difference]: Without dead ends: 87 [2018-04-09 22:21:04,290 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:21:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-09 22:21:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-04-09 22:21:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-09 22:21:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-04-09 22:21:04,297 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 37 [2018-04-09 22:21:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:21:04,298 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-04-09 22:21:04,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:21:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-04-09 22:21:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-09 22:21:04,299 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:21:04,299 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:21:04,299 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-09 22:21:04,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1900445346, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:21:04,313 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:21:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:21:04,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:21:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:21:04,396 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:21:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:21:04,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:21:04,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-09 22:21:04,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 22:21:04,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 22:21:04,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-04-09 22:21:04,492 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 10 states. [2018-04-09 22:21:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:21:04,546 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2018-04-09 22:21:04,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 22:21:04,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-04-09 22:21:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:21:04,548 INFO L225 Difference]: With dead ends: 152 [2018-04-09 22:21:04,548 INFO L226 Difference]: Without dead ends: 96 [2018-04-09 22:21:04,549 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-04-09 22:21:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-09 22:21:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-04-09 22:21:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-09 22:21:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-04-09 22:21:04,557 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 43 [2018-04-09 22:21:04,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:21:04,558 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-04-09 22:21:04,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 22:21:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-04-09 22:21:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 22:21:04,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:21:04,559 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:21:04,559 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-09 22:21:04,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1778096232, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:21:04,574 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:21:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:21:04,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:21:04,631 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-09 22:21:04,633 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-09 22:21:04,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-09 22:21:04,647 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-09 22:21:04,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,650 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-09 22:21:04,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-09 22:21:04,673 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-09 22:21:04,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-04-09 22:21:04,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-09 22:21:04,711 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-09 22:21:04,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-04-09 22:21:04,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-04-09 22:21:04,778 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-09 22:21:04,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-04-09 22:21:04,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-04-09 22:21:04,854 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 44 treesize of output 34 [2018-04-09 22:21:04,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:04,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-04-09 22:21:04,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:04,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-04-09 22:21:05,983 WARN L151 SmtUtils]: Spent 561ms on a formula simplification. DAG size of input: 161 DAG size of output 40 [2018-04-09 22:21:06,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 81 [2018-04-09 22:21:06,038 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2018-04-09 22:21:06,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,049 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2018-04-09 22:21:06,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 107 [2018-04-09 22:21:06,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 165 [2018-04-09 22:21:06,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 214 [2018-04-09 22:21:06,115 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:06,287 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:06,299 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:06,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:06,326 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:06,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:06,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 22:21:06,420 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:375, output treesize:108 [2018-04-09 22:21:06,494 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 82 [2018-04-09 22:21:06,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,504 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:21:06,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,515 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:21:06,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,518 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:21:06,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,519 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:21:06,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,521 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:21:06,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:06,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 175 [2018-04-09 22:21:06,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 22:21:06,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:06,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:06,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:7 [2018-04-09 22:21:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:21:06,656 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:21:06,849 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-09 22:21:08,072 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 99 DAG size of output 85 [2018-04-09 22:21:08,721 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 105 DAG size of output 91 [2018-04-09 22:21:09,456 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 98 [2018-04-09 22:21:10,457 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 104 DAG size of output 90 [2018-04-09 22:21:10,985 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 22:21:10,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:10,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:10,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:552, output treesize:1 [2018-04-09 22:21:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:21:11,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:21:11,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 40 [2018-04-09 22:21:11,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-09 22:21:11,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-09 22:21:11,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1305, Unknown=10, NotChecked=0, Total=1560 [2018-04-09 22:21:11,042 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 40 states. [2018-04-09 22:21:16,009 WARN L151 SmtUtils]: Spent 2650ms on a formula simplification. DAG size of input: 200 DAG size of output 146 [2018-04-09 22:21:17,442 WARN L151 SmtUtils]: Spent 727ms on a formula simplification. DAG size of input: 144 DAG size of output 120 [2018-04-09 22:21:20,772 WARN L151 SmtUtils]: Spent 2100ms on a formula simplification. DAG size of input: 180 DAG size of output 151 [2018-04-09 22:21:22,585 WARN L151 SmtUtils]: Spent 946ms on a formula simplification. DAG size of input: 137 DAG size of output 129 [2018-04-09 22:21:24,941 WARN L151 SmtUtils]: Spent 1280ms on a formula simplification. DAG size of input: 152 DAG size of output 143 [2018-04-09 22:21:26,010 WARN L148 SmtUtils]: Spent 391ms on a formula simplification that was a NOOP. DAG size: 122 [2018-04-09 22:21:27,575 WARN L151 SmtUtils]: Spent 339ms on a formula simplification. DAG size of input: 116 DAG size of output 115 [2018-04-09 22:21:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:21:29,371 INFO L93 Difference]: Finished difference Result 313 states and 338 transitions. [2018-04-09 22:21:29,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-09 22:21:29,372 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-04-09 22:21:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:21:29,376 INFO L225 Difference]: With dead ends: 313 [2018-04-09 22:21:29,376 INFO L226 Difference]: Without dead ends: 266 [2018-04-09 22:21:29,378 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=735, Invalid=4367, Unknown=10, NotChecked=0, Total=5112 [2018-04-09 22:21:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-09 22:21:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 116. [2018-04-09 22:21:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-09 22:21:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-04-09 22:21:29,394 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 52 [2018-04-09 22:21:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:21:29,394 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2018-04-09 22:21:29,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-09 22:21:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2018-04-09 22:21:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 22:21:29,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:21:29,395 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:21:29,396 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-09 22:21:29,396 INFO L82 PathProgramCache]: Analyzing trace with hash -248522691, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:21:29,401 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:21:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:21:29,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:21:29,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:21:29,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:21:29,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 22:21:29,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-09 22:21:29,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:21:29,481 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 10 treesize of output 9 [2018-04-09 22:21:29,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-09 22:21:29,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-09 22:21:29,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,502 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 18 treesize of output 37 [2018-04-09 22:21:29,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-09 22:21:29,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-09 22:21:29,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-04-09 22:21:29,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-09 22:21:29,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-04-09 22:21:29,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 163 [2018-04-09 22:21:29,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-09 22:21:29,624 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 37 treesize of output 29 [2018-04-09 22:21:29,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:29,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-04-09 22:21:29,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:29,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:7 [2018-04-09 22:21:30,343 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 176 DAG size of output 57 [2018-04-09 22:21:30,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 97 [2018-04-09 22:21:30,360 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-04-09 22:21:30,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2018-04-09 22:21:30,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 97 [2018-04-09 22:21:30,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 149 [2018-04-09 22:21:30,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 240 [2018-04-09 22:21:30,430 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:30,459 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:30,472 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:30,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:30,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:30,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:30,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-09 22:21:30,547 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:419, output treesize:130 [2018-04-09 22:21:30,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 91 [2018-04-09 22:21:30,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,659 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:21:30,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,664 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:21:30,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,672 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:21:30,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,674 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:21:30,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 16 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 249 [2018-04-09 22:21:30,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:30,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,750 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:21:30,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:21:30,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 87 [2018-04-09 22:21:30,759 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:21:30,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:30,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:21:30,782 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:139, output treesize:3 [2018-04-09 22:21:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:21:30,842 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:22:21,646 WARN L148 SmtUtils]: Spent 1760ms on a formula simplification that was a NOOP. DAG size: 85 [2018-04-09 22:22:38,196 WARN L148 SmtUtils]: Spent 2047ms on a formula simplification that was a NOOP. DAG size: 85 [2018-04-09 22:23:00,866 WARN L148 SmtUtils]: Spent 2054ms on a formula simplification that was a NOOP. DAG size: 91 [2018-04-09 22:23:42,121 WARN L148 SmtUtils]: Spent 1235ms on a formula simplification that was a NOOP. DAG size: 97 [2018-04-09 22:24:55,308 WARN L148 SmtUtils]: Spent 4069ms on a formula simplification that was a NOOP. DAG size: 95 [2018-04-09 22:24:57,328 WARN L1033 $PredicateComparison]: unable to prove that (or (< |c_#Ultimate.C_memcpy_dest.offset| 0) (< |c_#Ultimate.C_memcpy_src.offset| 0) (forall ((v_main_~p~0.offset_BEFORE_CALL_4 Int)) (or (< v_main_~p~0.offset_BEFORE_CALL_4 |c_#Ultimate.C_memcpy_dest.offset|) (= (mod (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| (select (select |c_#memory_int| |c_#Ultimate.C_memcpy_src.base|) |c_#Ultimate.C_memcpy_src.offset|)))) (store .cse3 (+ |c_#Ultimate.C_memcpy_dest.offset| 1) (select (select (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| .cse3) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| 1)))))) (store .cse2 (+ |c_#Ultimate.C_memcpy_dest.offset| 2) (select (select (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| .cse2) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| 2)))))) (store .cse1 (+ |c_#Ultimate.C_memcpy_dest.offset| 3) (select (select (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| .cse1) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| 3)))))) (store .cse0 (+ |c_#Ultimate.C_memcpy_dest.offset| 4) (select (select (store |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base| .cse0) |c_#Ultimate.C_memcpy_src.base|) (+ |c_#Ultimate.C_memcpy_src.offset| 4)))) (+ v_main_~p~0.offset_BEFORE_CALL_4 1)) 256) 2) (exists ((|v_#Ultimate.C_memcpy_dest.offset_13| Int) (|v_#Ultimate.C_memcpy_src.offset_12| Int)) (and (not (= (mod (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |v_#Ultimate.C_memcpy_dest.offset_13| (select (select |c_old(#memory_int)| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) |v_#Ultimate.C_memcpy_src.offset_12|)))) (store .cse7 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 1) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| .cse7) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 1)))))) (store .cse6 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 2) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| .cse6) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 2)))))) (store .cse5 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 3) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| .cse5) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 3)))))) (store .cse4 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 4) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| .cse4) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 4)))) (+ v_main_~p~0.offset_BEFORE_CALL_4 1)) 256) 2)) (<= 0 |v_#Ultimate.C_memcpy_dest.offset_13|) (<= |v_#Ultimate.C_memcpy_src.offset_12| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset|) (<= 0 |v_#Ultimate.C_memcpy_src.offset_12|) (<= |v_#Ultimate.C_memcpy_dest.offset_13| v_main_~p~0.offset_BEFORE_CALL_4))))) (< |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| |c_#Ultimate.C_memcpy_src.offset|) (not (= |c_#Ultimate.C_memcpy_src.base| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|))) is different from true [2018-04-09 22:24:59,408 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_#Ultimate.C_memcpy_dest.offset_13| Int) (|v_#Ultimate.C_memcpy_src.offset_12| Int)) (or (< |v_#Ultimate.C_memcpy_src.offset_12| 0) (< |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| |v_#Ultimate.C_memcpy_src.offset_12|) (= (mod (select (let ((.cse5 (store (select |c_#memory_int| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 4) 5))) (let ((.cse1 (store |c_#memory_int| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| .cse5))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (select .cse1 c_main_~p~0.base) |v_#Ultimate.C_memcpy_dest.offset_13| (select .cse5 |v_#Ultimate.C_memcpy_src.offset_12|)))) (store .cse4 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 1) (select (select (store .cse1 c_main_~p~0.base .cse4) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 1)))))) (store .cse3 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 2) (select (select (store .cse1 c_main_~p~0.base .cse3) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 2)))))) (store .cse2 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 3) (select (select (store .cse1 c_main_~p~0.base .cse2) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 3)))))) (store .cse0 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 4) (select (select (store .cse1 c_main_~p~0.base .cse0) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 4)))))) (+ c_main_~p~0.offset 1)) 256) 2) (< c_main_~p~0.offset |v_#Ultimate.C_memcpy_dest.offset_13|) (< |v_#Ultimate.C_memcpy_dest.offset_13| 0))) is different from false [2018-04-09 22:25:01,438 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_#Ultimate.C_memcpy_dest.offset_13| Int) (|v_#Ultimate.C_memcpy_src.offset_12| Int)) (or (< |v_#Ultimate.C_memcpy_src.offset_12| 0) (= 2 (mod (select (let ((.cse5 (store (store (select |c_#memory_int| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 3) 4) (+ |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| 4) 5))) (let ((.cse1 (store |c_#memory_int| |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base| .cse5))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store (select .cse1 c_main_~p~0.base) |v_#Ultimate.C_memcpy_dest.offset_13| (select .cse5 |v_#Ultimate.C_memcpy_src.offset_12|)))) (store .cse4 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 1) (select (select (store .cse1 c_main_~p~0.base .cse4) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 1)))))) (store .cse3 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 2) (select (select (store .cse1 c_main_~p~0.base .cse3) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 2)))))) (store .cse2 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 3) (select (select (store .cse1 c_main_~p~0.base .cse2) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 3)))))) (store .cse0 (+ |v_#Ultimate.C_memcpy_dest.offset_13| 4) (select (select (store .cse1 c_main_~p~0.base .cse0) |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.base|) (+ |v_#Ultimate.C_memcpy_src.offset_12| 4)))))) (+ c_main_~p~0.offset 1)) 256)) (< |c_~#__U_MULTI_ftest_bitfields___false_valid_deref_i__d~0.offset| |v_#Ultimate.C_memcpy_src.offset_12|) (< c_main_~p~0.offset |v_#Ultimate.C_memcpy_dest.offset_13|) (< |v_#Ultimate.C_memcpy_dest.offset_13| 0))) is different from false Received shutdown request... [2018-04-09 22:25:47,810 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-09 22:25:47,810 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 22:25:47,814 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 22:25:47,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 10:25:47 BoogieIcfgContainer [2018-04-09 22:25:47,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 22:25:47,815 INFO L168 Benchmark]: Toolchain (without parser) took 285958.09 ms. Allocated memory was 295.7 MB in the beginning and 544.2 MB in the end (delta: 248.5 MB). Free memory was 239.3 MB in the beginning and 400.7 MB in the end (delta: -161.4 MB). Peak memory consumption was 87.1 MB. Max. memory is 5.3 GB. [2018-04-09 22:25:47,816 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 295.7 MB. Free memory is still 258.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 22:25:47,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.74 ms. Allocated memory is still 295.7 MB. Free memory was 239.3 MB in the beginning and 228.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-04-09 22:25:47,817 INFO L168 Benchmark]: Boogie Preprocessor took 34.70 ms. Allocated memory is still 295.7 MB. Free memory was 228.4 MB in the beginning and 226.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-09 22:25:47,817 INFO L168 Benchmark]: RCFGBuilder took 474.12 ms. Allocated memory was 295.7 MB in the beginning and 448.3 MB in the end (delta: 152.6 MB). Free memory was 226.4 MB in the beginning and 405.7 MB in the end (delta: -179.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-04-09 22:25:47,817 INFO L168 Benchmark]: TraceAbstraction took 285242.79 ms. Allocated memory was 448.3 MB in the beginning and 544.2 MB in the end (delta: 95.9 MB). Free memory was 405.7 MB in the beginning and 400.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 100.9 MB. Max. memory is 5.3 GB. [2018-04-09 22:25:47,819 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.19 ms. Allocated memory is still 295.7 MB. Free memory is still 258.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.74 ms. Allocated memory is still 295.7 MB. Free memory was 239.3 MB in the beginning and 228.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.70 ms. Allocated memory is still 295.7 MB. Free memory was 228.4 MB in the beginning and 226.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 474.12 ms. Allocated memory was 295.7 MB in the beginning and 448.3 MB in the end (delta: 152.6 MB). Free memory was 226.4 MB in the beginning and 405.7 MB in the end (delta: -179.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 285242.79 ms. Allocated memory was 448.3 MB in the beginning and 544.2 MB in the end (delta: 95.9 MB). Free memory was 405.7 MB in the beginning and 400.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 100.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 22]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 22). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 37 error locations. TIMEOUT Result, 285.1s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 18.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 472 SDtfs, 1931 SDslu, 1358 SDs, 0 SdLazy, 1286 SolverSat, 368 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 335 SyntacticMatches, 10 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 18.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 230 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 398 ConstructedInterpolants, 44 QuantifiedInterpolants, 986432 SizeOfPredicates, 21 NumberOfNonLiveVariables, 730 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/80 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_22-25-47-829.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_22-25-47-829.csv Completed graceful shutdown