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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:52:45,055 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:52:45,057 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:52:45,070 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:52:45,070 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:52:45,070 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:52:45,071 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:52:45,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:52:45,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:52:45,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:52:45,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:52:45,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:52:45,075 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:52:45,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:52:45,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:52:45,079 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:52:45,081 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:52:45,083 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:52:45,084 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:52:45,085 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:52:45,088 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:52:45,088 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:52:45,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:52:45,089 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:52:45,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:52:45,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:52:45,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:52:45,092 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:52:45,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:52:45,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:52:45,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:52:45,094 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:52:45,104 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:52:45,104 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:52:45,105 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:52:45,105 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:52:45,105 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:52:45,105 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:52:45,105 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:52:45,106 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:52:45,106 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:52:45,106 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:52:45,106 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:52:45,107 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:52:45,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:52:45,107 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:52:45,107 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:52:45,107 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:52:45,108 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:52:45,108 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:52:45,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:52:45,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:52:45,108 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:52:45,109 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:52:45,109 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:52:45,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:52:45,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:52:45,109 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:52:45,110 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:52:45,110 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:52:45,110 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:52:45,110 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:52:45,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:52:45,110 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:52:45,111 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:52:45,111 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:52:45,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:52:45,157 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:52:45,160 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:52:45,161 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:52:45,161 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:52:45,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-deref.i [2018-01-24 11:52:45,477 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:52:45,485 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:52:45,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:52:45,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:52:45,495 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:52:45,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:52:45" (1/1) ... [2018-01-24 11:52:45,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8bf943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:45, skipping insertion in model container [2018-01-24 11:52:45,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:52:45" (1/1) ... [2018-01-24 11:52:45,523 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:52:45,580 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:52:45,732 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:52:45,771 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:52:45,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:45 WrapperNode [2018-01-24 11:52:45,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:52:45,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:52:45,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:52:45,792 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:52:45,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:45" (1/1) ... [2018-01-24 11:52:45,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:45" (1/1) ... [2018-01-24 11:52:45,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:45" (1/1) ... [2018-01-24 11:52:45,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:45" (1/1) ... [2018-01-24 11:52:45,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:45" (1/1) ... [2018-01-24 11:52:45,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:45" (1/1) ... [2018-01-24 11:52:45,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:45" (1/1) ... [2018-01-24 11:52:45,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:52:45,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:52:45,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:52:45,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:52:45,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:45" (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-01-24 11:52:45,950 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:52:45,951 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:52:45,951 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-01-24 11:52:45,951 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-01-24 11:52:45,951 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-01-24 11:52:45,951 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-01-24 11:52:45,951 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-01-24 11:52:45,951 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-01-24 11:52:45,951 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-01-24 11:52:45,951 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-01-24 11:52:45,952 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-01-24 11:52:45,952 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-01-24 11:52:45,952 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-01-24 11:52:45,952 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-01-24 11:52:45,952 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:52:45,952 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 11:52:45,953 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 11:52:45,953 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:52:45,953 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:52:45,953 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:52:45,953 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 11:52:45,953 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 11:52:45,954 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 11:52:45,954 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 11:52:45,954 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 11:52:45,954 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 11:52:45,954 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-01-24 11:52:45,954 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:52:45,955 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-01-24 11:52:45,955 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-01-24 11:52:45,955 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-01-24 11:52:45,955 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-01-24 11:52:45,955 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-01-24 11:52:45,955 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-01-24 11:52:45,955 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-01-24 11:52:45,956 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-01-24 11:52:45,956 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-01-24 11:52:45,956 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-01-24 11:52:45,956 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-01-24 11:52:45,956 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:52:45,956 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:52:45,956 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:52:46,596 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 11:52:46,840 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:52:46,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:52:46 BoogieIcfgContainer [2018-01-24 11:52:46,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:52:46,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:52:46,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:52:46,845 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:52:46,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:52:45" (1/3) ... [2018-01-24 11:52:46,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d24041f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:52:46, skipping insertion in model container [2018-01-24 11:52:46,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:52:45" (2/3) ... [2018-01-24 11:52:46,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d24041f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:52:46, skipping insertion in model container [2018-01-24 11:52:46,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:52:46" (3/3) ... [2018-01-24 11:52:46,849 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0235_false-valid-deref.i [2018-01-24 11:52:46,857 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:52:46,864 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2018-01-24 11:52:46,915 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:52:46,915 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:52:46,916 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:52:46,916 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:52:46,916 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:52:46,916 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:52:46,930 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:52:46,930 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:52:46,931 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:52:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2018-01-24 11:52:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 11:52:46,968 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:52:46,969 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 11:52:46,970 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:52:46,974 INFO L82 PathProgramCache]: Analyzing trace with hash 15319548, now seen corresponding path program 1 times [2018-01-24 11:52:46,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:52:46,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:52:47,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:47,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:47,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:52:47,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:52:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:52:47,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:52:47,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:52:47,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:52:47,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:52:47,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:52:47,253 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 3 states. [2018-01-24 11:52:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:52:47,976 INFO L93 Difference]: Finished difference Result 661 states and 809 transitions. [2018-01-24 11:52:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:52:47,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 11:52:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:52:47,999 INFO L225 Difference]: With dead ends: 661 [2018-01-24 11:52:47,999 INFO L226 Difference]: Without dead ends: 391 [2018-01-24 11:52:48,007 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:52:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-01-24 11:52:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 345. [2018-01-24 11:52:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-01-24 11:52:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 426 transitions. [2018-01-24 11:52:48,085 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 426 transitions. Word has length 4 [2018-01-24 11:52:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:52:48,085 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 426 transitions. [2018-01-24 11:52:48,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:52:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 426 transitions. [2018-01-24 11:52:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 11:52:48,086 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:52:48,086 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 11:52:48,087 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:52:48,087 INFO L82 PathProgramCache]: Analyzing trace with hash 15319549, now seen corresponding path program 1 times [2018-01-24 11:52:48,087 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:52:48,087 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:52:48,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:48,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:48,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:52:48,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:52:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:52:48,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:52:48,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:52:48,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:52:48,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:52:48,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:52:48,160 INFO L87 Difference]: Start difference. First operand 345 states and 426 transitions. Second operand 3 states. [2018-01-24 11:52:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:52:48,347 INFO L93 Difference]: Finished difference Result 353 states and 437 transitions. [2018-01-24 11:52:48,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:52:48,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 11:52:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:52:48,351 INFO L225 Difference]: With dead ends: 353 [2018-01-24 11:52:48,351 INFO L226 Difference]: Without dead ends: 352 [2018-01-24 11:52:48,353 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:52:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-01-24 11:52:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2018-01-24 11:52:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-24 11:52:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 425 transitions. [2018-01-24 11:52:48,392 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 425 transitions. Word has length 4 [2018-01-24 11:52:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:52:48,393 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 425 transitions. [2018-01-24 11:52:48,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:52:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 425 transitions. [2018-01-24 11:52:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:52:48,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:52:48,394 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:52:48,394 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:52:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash 116258063, now seen corresponding path program 1 times [2018-01-24 11:52:48,394 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:52:48,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:52:48,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:48,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:48,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:48,419 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:52:48,419 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:52:48,419 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:52:48,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:52:48,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:52:48,523 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-01-24 11:52:48,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:52:48,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:52:48,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:52:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:52:48,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:52:48,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:52:48,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:52:48,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:52:48,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:52:48,565 INFO L87 Difference]: Start difference. First operand 344 states and 425 transitions. Second operand 4 states. [2018-01-24 11:52:48,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:52:48,813 INFO L93 Difference]: Finished difference Result 344 states and 425 transitions. [2018-01-24 11:52:48,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:52:48,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 11:52:48,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:52:48,816 INFO L225 Difference]: With dead ends: 344 [2018-01-24 11:52:48,816 INFO L226 Difference]: Without dead ends: 343 [2018-01-24 11:52:48,816 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-01-24 11:52:48,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-01-24 11:52:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-01-24 11:52:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-01-24 11:52:48,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 424 transitions. [2018-01-24 11:52:48,842 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 424 transitions. Word has length 17 [2018-01-24 11:52:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:52:48,842 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 424 transitions. [2018-01-24 11:52:48,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:52:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 424 transitions. [2018-01-24 11:52:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:52:48,843 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:52:48,844 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:52:48,844 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:52:48,844 INFO L82 PathProgramCache]: Analyzing trace with hash 116258064, now seen corresponding path program 1 times [2018-01-24 11:52:48,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:52:48,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:52:48,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:48,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:48,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:48,876 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:52:48,876 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:52:48,876 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:52:48,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:52:48,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:52:48,926 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 24 treesize of output 23 [2018-01-24 11:52:48,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:52:48,946 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 21 treesize of output 20 [2018-01-24 11:52:48,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:52:48,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:52:48,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-01-24 11:52:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:52:49,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:52:49,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:52:49,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:52:49,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:52:49,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:52:49,039 INFO L87 Difference]: Start difference. First operand 343 states and 424 transitions. Second operand 4 states. [2018-01-24 11:52:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:52:49,367 INFO L93 Difference]: Finished difference Result 343 states and 424 transitions. [2018-01-24 11:52:49,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:52:49,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 11:52:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:52:49,369 INFO L225 Difference]: With dead ends: 343 [2018-01-24 11:52:49,369 INFO L226 Difference]: Without dead ends: 342 [2018-01-24 11:52:49,370 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-01-24 11:52:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-01-24 11:52:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2018-01-24 11:52:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-01-24 11:52:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 423 transitions. [2018-01-24 11:52:49,391 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 423 transitions. Word has length 17 [2018-01-24 11:52:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:52:49,392 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 423 transitions. [2018-01-24 11:52:49,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:52:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 423 transitions. [2018-01-24 11:52:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-24 11:52:49,397 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:52:49,397 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:52:49,397 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:52:49,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2125517946, now seen corresponding path program 1 times [2018-01-24 11:52:49,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:52:49,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:52:49,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:49,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:49,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:49,425 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:52:49,426 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:52:49,426 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:52:49,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:52:49,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:52:49,605 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-01-24 11:52:49,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:52:49,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:52:49,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:52:49,823 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1)))) is different from true [2018-01-24 11:52:49,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:52:49,841 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 11:52:49,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:52:49,843 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-01-24 11:52:49,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 11:52:49,862 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~5.base_BEFORE_CALL_1))) (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1))))) is different from true [2018-01-24 11:52:49,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:52:49,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:52:49,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-24 11:52:49,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:52:49,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 11:52:49,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-01-24 11:52:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-01-24 11:52:50,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:52:50,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-01-24 11:52:50,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:52:50,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:52:50,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-01-24 11:52:50,027 INFO L87 Difference]: Start difference. First operand 342 states and 423 transitions. Second operand 15 states. [2018-01-24 11:52:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:52:51,883 INFO L93 Difference]: Finished difference Result 520 states and 639 transitions. [2018-01-24 11:52:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:52:51,886 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-01-24 11:52:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:52:51,890 INFO L225 Difference]: With dead ends: 520 [2018-01-24 11:52:51,891 INFO L226 Difference]: Without dead ends: 518 [2018-01-24 11:52:51,891 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-01-24 11:52:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-01-24 11:52:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 385. [2018-01-24 11:52:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-01-24 11:52:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 498 transitions. [2018-01-24 11:52:51,921 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 498 transitions. Word has length 142 [2018-01-24 11:52:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:52:51,922 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 498 transitions. [2018-01-24 11:52:51,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:52:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 498 transitions. [2018-01-24 11:52:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-24 11:52:51,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:52:51,925 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:52:51,925 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:52:51,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2125517947, now seen corresponding path program 1 times [2018-01-24 11:52:51,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:52:51,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:52:51,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:51,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:51,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:51,946 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:52:51,947 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:52:51,947 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:52:51,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:52:52,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:52:52,521 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 14 DAG size of output 10 [2018-01-24 11:52:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-01-24 11:52:52,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:52:52,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:52:52,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:52:52,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:52:52,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:52:52,614 INFO L87 Difference]: Start difference. First operand 385 states and 498 transitions. Second operand 8 states. [2018-01-24 11:52:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:52:52,889 INFO L93 Difference]: Finished difference Result 773 states and 1010 transitions. [2018-01-24 11:52:52,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:52:52,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-01-24 11:52:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:52:52,899 INFO L225 Difference]: With dead ends: 773 [2018-01-24 11:52:52,899 INFO L226 Difference]: Without dead ends: 386 [2018-01-24 11:52:52,912 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:52:52,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-24 11:52:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2018-01-24 11:52:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-01-24 11:52:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 499 transitions. [2018-01-24 11:52:52,955 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 499 transitions. Word has length 142 [2018-01-24 11:52:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:52:52,956 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 499 transitions. [2018-01-24 11:52:52,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:52:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 499 transitions. [2018-01-24 11:52:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-24 11:52:52,965 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:52:52,966 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:52:52,966 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:52:52,967 INFO L82 PathProgramCache]: Analyzing trace with hash 370058419, now seen corresponding path program 1 times [2018-01-24 11:52:52,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:52:52,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:52:52,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:52,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:52,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:53,029 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:52:53,036 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:52:53,036 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-01-24 11:52:53,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:52:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:52:53,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:52:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-01-24 11:52:53,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:52:53,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-01-24 11:52:53,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:52:53,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:52:53,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:52:53,517 INFO L87 Difference]: Start difference. First operand 386 states and 499 transitions. Second operand 9 states. [2018-01-24 11:52:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:52:53,718 INFO L93 Difference]: Finished difference Result 775 states and 1012 transitions. [2018-01-24 11:52:53,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:52:53,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-01-24 11:52:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:52:53,722 INFO L225 Difference]: With dead ends: 775 [2018-01-24 11:52:53,722 INFO L226 Difference]: Without dead ends: 387 [2018-01-24 11:52:53,724 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:52:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-01-24 11:52:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-01-24 11:52:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-01-24 11:52:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 500 transitions. [2018-01-24 11:52:53,750 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 500 transitions. Word has length 148 [2018-01-24 11:52:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:52:53,750 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 500 transitions. [2018-01-24 11:52:53,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:52:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 500 transitions. [2018-01-24 11:52:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-01-24 11:52:53,753 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:52:53,753 INFO L322 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:52:53,753 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:52:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1295616315, now seen corresponding path program 2 times [2018-01-24 11:52:53,754 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:52:53,754 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:52:53,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:53,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:52:53,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:53,774 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:52:53,774 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:52:53,774 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:52:53,780 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:52:53,815 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:52:53,856 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:52:55,004 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:52:55,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:52:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 110 proven. 71 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-01-24 11:52:55,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:52:55,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-01-24 11:52:55,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 11:52:55,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 11:52:55,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:52:55,216 INFO L87 Difference]: Start difference. First operand 387 states and 500 transitions. Second operand 10 states. [2018-01-24 11:52:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:52:55,827 INFO L93 Difference]: Finished difference Result 777 states and 1014 transitions. [2018-01-24 11:52:55,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:52:55,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-01-24 11:52:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:52:55,830 INFO L225 Difference]: With dead ends: 777 [2018-01-24 11:52:55,830 INFO L226 Difference]: Without dead ends: 388 [2018-01-24 11:52:55,832 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:52:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-01-24 11:52:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-01-24 11:52:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-01-24 11:52:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 501 transitions. [2018-01-24 11:52:55,867 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 501 transitions. Word has length 154 [2018-01-24 11:52:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:52:55,868 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 501 transitions. [2018-01-24 11:52:55,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 11:52:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 501 transitions. [2018-01-24 11:52:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-01-24 11:52:55,871 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:52:55,871 INFO L322 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:52:55,871 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:52:55,872 INFO L82 PathProgramCache]: Analyzing trace with hash -456422541, now seen corresponding path program 3 times [2018-01-24 11:52:55,872 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:52:55,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:52:55,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:55,873 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:52:55,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:55,888 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:52:55,888 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:52:55,888 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:52:55,904 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 11:52:55,945 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:52:55,956 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:52:55,983 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:52:56,045 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:52:56,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:52:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-01-24 11:52:56,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:52:56,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-01-24 11:52:56,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 11:52:56,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 11:52:56,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:52:56,258 INFO L87 Difference]: Start difference. First operand 388 states and 501 transitions. Second operand 11 states. [2018-01-24 11:52:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:52:56,444 INFO L93 Difference]: Finished difference Result 779 states and 1016 transitions. [2018-01-24 11:52:56,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:52:56,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 160 [2018-01-24 11:52:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:52:56,446 INFO L225 Difference]: With dead ends: 779 [2018-01-24 11:52:56,446 INFO L226 Difference]: Without dead ends: 389 [2018-01-24 11:52:56,447 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:52:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-24 11:52:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-01-24 11:52:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-01-24 11:52:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 502 transitions. [2018-01-24 11:52:56,465 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 502 transitions. Word has length 160 [2018-01-24 11:52:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:52:56,465 INFO L432 AbstractCegarLoop]: Abstraction has 389 states and 502 transitions. [2018-01-24 11:52:56,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 11:52:56,465 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 502 transitions. [2018-01-24 11:52:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-01-24 11:52:56,467 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:52:56,467 INFO L322 BasicCegarLoop]: trace histogram [24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:52:56,467 INFO L371 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:52:56,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2005786107, now seen corresponding path program 4 times [2018-01-24 11:52:56,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:52:56,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:52:56,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:56,469 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:52:56,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:56,483 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:52:56,483 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:52:56,483 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:52:56,494 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 11:52:58,664 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:52:58,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:52:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 453 proven. 11 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-01-24 11:52:58,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:52:58,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-01-24 11:52:58,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:52:58,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:52:58,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:52:58,813 INFO L87 Difference]: Start difference. First operand 389 states and 502 transitions. Second operand 12 states. [2018-01-24 11:52:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:52:59,001 INFO L93 Difference]: Finished difference Result 781 states and 1018 transitions. [2018-01-24 11:52:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:52:59,002 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-01-24 11:52:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:52:59,004 INFO L225 Difference]: With dead ends: 781 [2018-01-24 11:52:59,004 INFO L226 Difference]: Without dead ends: 390 [2018-01-24 11:52:59,006 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:52:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-01-24 11:52:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-01-24 11:52:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-01-24 11:52:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 503 transitions. [2018-01-24 11:52:59,029 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 503 transitions. Word has length 166 [2018-01-24 11:52:59,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:52:59,030 INFO L432 AbstractCegarLoop]: Abstraction has 390 states and 503 transitions. [2018-01-24 11:52:59,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:52:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 503 transitions. [2018-01-24 11:52:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-01-24 11:52:59,032 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:52:59,032 INFO L322 BasicCegarLoop]: trace histogram [30, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:52:59,032 INFO L371 AbstractCegarLoop]: === Iteration 11 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:52:59,033 INFO L82 PathProgramCache]: Analyzing trace with hash -709586381, now seen corresponding path program 5 times [2018-01-24 11:52:59,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:52:59,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:52:59,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:59,034 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:52:59,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:52:59,050 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:52:59,050 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:52:59,050 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:52:59,066 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 11:52:59,098 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:52:59,100 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:52:59,107 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:52:59,146 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:52:59,700 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:53:02,139 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:53:02,150 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:53:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 437 proven. 62 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-01-24 11:53:02,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:53:02,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-01-24 11:53:02,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:53:02,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:53:02,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:53:02,358 INFO L87 Difference]: Start difference. First operand 390 states and 503 transitions. Second operand 15 states. [2018-01-24 11:53:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:53:02,676 INFO L93 Difference]: Finished difference Result 783 states and 1020 transitions. [2018-01-24 11:53:02,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:53:02,677 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 172 [2018-01-24 11:53:02,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:53:02,679 INFO L225 Difference]: With dead ends: 783 [2018-01-24 11:53:02,679 INFO L226 Difference]: Without dead ends: 391 [2018-01-24 11:53:02,681 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-01-24 11:53:02,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-01-24 11:53:02,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-01-24 11:53:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-01-24 11:53:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 504 transitions. [2018-01-24 11:53:02,708 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 504 transitions. Word has length 172 [2018-01-24 11:53:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:53:02,709 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 504 transitions. [2018-01-24 11:53:02,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:53:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 504 transitions. [2018-01-24 11:53:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-24 11:53:02,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:53:02,710 INFO L322 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:53:02,710 INFO L371 AbstractCegarLoop]: === Iteration 12 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 11:53:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash 137220795, now seen corresponding path program 6 times [2018-01-24 11:53:02,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:53:02,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:53:02,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:53:02,715 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:53:02,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:53:02,740 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 11:53:02,741 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 11:53:02,741 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 11:53:02,759 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 11:53:02,811 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 11:53:02,818 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 11:53:02,834 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 11:53:02,884 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 11:53:03,165 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 11:53:04,489 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:53:04,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:53:04,518 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 30 treesize of output 29 [2018-01-24 11:53:04,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:53:07,618 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 27 treesize of output 26 [2018-01-24 11:53:07,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:53:07,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:53:07,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:56 [2018-01-24 11:53:07,969 WARN L143 SmtUtils]: Spent 280ms on a formula simplification that was a NOOP. DAG size: 24 [2018-01-24 11:53:09,975 WARN L1029 $PredicateComparison]: unable to prove that (or (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_2 Int) (v_calloc_model_~nmemb_BEFORE_CALL_7 Int) (v_calloc_model_~size_BEFORE_CALL_7 Int)) (let ((.cse0 (mod (* v_calloc_model_~nmemb_BEFORE_CALL_7 v_calloc_model_~size_BEFORE_CALL_7) 4294967296))) (and (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_2) 4294967296) .cse0) (< 2147483647 .cse0)))) (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int)) (let ((.cse1 (mod (* v_prenex_4 v_prenex_5) 4294967296))) (and (= (select |c_#length| v_prenex_3) .cse1) (<= .cse1 2147483647))))) is different from true [2018-01-24 11:53:11,795 WARN L143 SmtUtils]: Spent 1801ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-24 11:53:12,992 WARN L143 SmtUtils]: Spent 1062ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-24 11:53:13,447 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 23 treesize of output 22 [2018-01-24 11:53:13,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:53:13,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 22 treesize of output 17 [2018-01-24 11:53:13,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:53:13,503 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 25 treesize of output 24 [2018-01-24 11:53:13,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:53:13,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 19 [2018-01-24 11:53:13,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:53:13,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 11:53:13,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-01-24 11:53:13,624 WARN L1029 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse0 (mod (* v_prenex_14 v_prenex_12) 4294967296))) (and (= (select |c_#length| v_prenex_13) .cse0) (<= .cse0 2147483647)))) (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_8| Int)) (let ((.cse1 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_8| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse1) (= .cse1 (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296)))))) is different from true [2018-01-24 11:53:21,575 WARN L146 SmtUtils]: Spent 7841ms on a formula simplification. DAG size of input: 57 DAG size of output 32 [2018-01-24 11:53:21,585 WARN L1029 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~ptr~5.base Int) (calloc_model_~size Int)) (let ((.cse0 (mod calloc_model_~size 4294967296))) (and (= (select |c_old(#valid)| calloc_model_~ptr~5.base) 0) (< 2147483647 .cse0) (= (store |c_old(#length)| calloc_model_~ptr~5.base (+ .cse0 (- 4294967296))) |c_#length|)))) (exists ((v_prenex_17 Int) (v_prenex_12 Int)) (let ((.cse1 (mod v_prenex_12 4294967296))) (and (= (store |c_old(#length)| v_prenex_17 .cse1) |c_#length|) (= (select |c_old(#valid)| v_prenex_17) 0) (<= .cse1 2147483647))))) is different from true [2018-01-24 11:53:21,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:53:21,612 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-01-24 11:53:21,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:53:21,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:53:21,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:53:21,661 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 34 treesize of output 47 [2018-01-24 11:53:21,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:53:21,697 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:53:21,698 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:53:21,699 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 33 treesize of output 27 [2018-01-24 11:53:21,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:53:21,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:53:21,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:53:21,725 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 31 treesize of output 25 [2018-01-24 11:53:21,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:53:21,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 11:53:21,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-01-24 11:53:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 522 proven. 13 refuted. 0 times theorem prover too weak. 524 trivial. 57 not checked. [2018-01-24 11:53:21,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:53:21,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-01-24 11:53:21,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 11:53:21,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 11:53:21,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=412, Unknown=8, NotChecked=126, Total=600 [2018-01-24 11:53:21,981 INFO L87 Difference]: Start difference. First operand 391 states and 504 transitions. Second operand 25 states. [2018-01-24 11:53:26,388 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-01-24 11:53:48,245 WARN L146 SmtUtils]: Spent 19673ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-01-24 11:53:54,122 WARN L146 SmtUtils]: Spent 5022ms on a formula simplification. DAG size of input: 53 DAG size of output 31 Received shutdown request... [2018-01-24 11:53:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:53:54,798 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 11:53:54,805 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 11:53:54,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:53:54 BoogieIcfgContainer [2018-01-24 11:53:54,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:53:54,806 INFO L168 Benchmark]: Toolchain (without parser) took 69328.48 ms. Allocated memory was 305.7 MB in the beginning and 592.4 MB in the end (delta: 286.8 MB). Free memory was 264.7 MB in the beginning and 351.9 MB in the end (delta: -87.2 MB). Peak memory consumption was 199.6 MB. Max. memory is 5.3 GB. [2018-01-24 11:53:54,807 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:53:54,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.42 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 251.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:53:54,808 INFO L168 Benchmark]: Boogie Preprocessor took 67.45 ms. Allocated memory is still 305.7 MB. Free memory was 251.7 MB in the beginning and 249.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:53:54,808 INFO L168 Benchmark]: RCFGBuilder took 982.09 ms. Allocated memory is still 305.7 MB. Free memory was 249.7 MB in the beginning and 192.4 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 5.3 GB. [2018-01-24 11:53:54,809 INFO L168 Benchmark]: TraceAbstraction took 67962.87 ms. Allocated memory was 305.7 MB in the beginning and 592.4 MB in the end (delta: 286.8 MB). Free memory was 192.4 MB in the beginning and 351.9 MB in the end (delta: -159.5 MB). Peak memory consumption was 127.3 MB. Max. memory is 5.3 GB. [2018-01-24 11:53:54,811 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.11 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 304.42 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 251.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 67.45 ms. Allocated memory is still 305.7 MB. Free memory was 251.7 MB in the beginning and 249.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 982.09 ms. Allocated memory is still 305.7 MB. Free memory was 249.7 MB in the beginning and 192.4 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 67962.87 ms. Allocated memory was 305.7 MB in the beginning and 592.4 MB in the end (delta: 286.8 MB). Free memory was 192.4 MB in the beginning and 351.9 MB in the end (delta: -159.5 MB). Peak memory consumption was 127.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 888). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (391states) and interpolant automaton (currently 8 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 275 locations, 85 error locations. TIMEOUT Result, 67.8s OverallTime, 12 OverallIterations, 36 TraceHistogramMax, 38.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3034 SDtfs, 869 SDslu, 17233 SDs, 0 SdLazy, 3215 SolverSat, 148 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1325 GetRequests, 1192 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 45.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, 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, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 187 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1292 ConstructedInterpolants, 52 QuantifiedInterpolants, 695203 SizeOfPredicates, 61 NumberOfNonLiveVariables, 5050 ConjunctsInSsa, 311 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 4261/4491 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-53-54-823.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-53-54-823.csv Completed graceful shutdown