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_SS.epf -i ../../../trunk/examples/svcomp/memsafety/test-0235_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:40:51,718 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:40:51,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:40:51,731 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:40:51,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:40:51,733 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:40:51,733 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:40:51,734 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:40:51,736 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:40:51,737 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:40:51,737 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:40:51,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:40:51,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:40:51,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:40:51,740 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:40:51,742 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:40:51,744 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:40:51,746 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:40:51,747 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:40:51,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:40:51,751 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:40:51,751 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:40:51,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:40:51,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:40:51,753 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:40:51,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:40:51,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:40:51,755 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:40:51,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:40:51,755 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:40:51,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:40:51,756 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_SS.epf [2018-01-28 21:40:51,766 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:40:51,766 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:40:51,767 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:40:51,767 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:40:51,767 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:40:51,767 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:40:51,767 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:40:51,768 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:40:51,768 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:40:51,768 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:40:51,769 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:40:51,769 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:40:51,769 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:40:51,769 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:40:51,769 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:40:51,769 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:40:51,770 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:40:51,770 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:40:51,770 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:40:51,770 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:40:51,770 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:40:51,771 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:40:51,771 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:40:51,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:40:51,771 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:40:51,771 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:40:51,772 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:40:51,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:40:51,772 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:40:51,772 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:40:51,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:40:51,773 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:40:51,774 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:40:51,774 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:40:51,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:40:51,821 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:40:51,824 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:40:51,826 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:40:51,826 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:40:51,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_true-valid-memsafety.i [2018-01-28 21:40:52,026 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:40:52,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:40:52,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:40:52,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:40:52,037 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:40:52,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:40:52" (1/1) ... [2018-01-28 21:40:52,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65db1985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:40:52, skipping insertion in model container [2018-01-28 21:40:52,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:40:52" (1/1) ... [2018-01-28 21:40:52,058 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:40:52,102 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:40:52,227 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:40:52,250 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:40:52,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:40:52 WrapperNode [2018-01-28 21:40:52,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:40:52,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:40:52,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:40:52,276 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:40:52,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:40:52" (1/1) ... [2018-01-28 21:40:52,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:40:52" (1/1) ... [2018-01-28 21:40:52,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:40:52" (1/1) ... [2018-01-28 21:40:52,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:40:52" (1/1) ... [2018-01-28 21:40:52,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:40:52" (1/1) ... [2018-01-28 21:40:52,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:40:52" (1/1) ... [2018-01-28 21:40:52,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:40:52" (1/1) ... [2018-01-28 21:40:52,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:40:52,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:40:52,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:40:52,318 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:40:52,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:40:52" (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-28 21:40:52,366 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:40:52,367 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:40:52,367 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-01-28 21:40:52,367 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-01-28 21:40:52,367 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-01-28 21:40:52,367 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-01-28 21:40:52,367 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-01-28 21:40:52,367 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-01-28 21:40:52,367 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-01-28 21:40:52,367 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-01-28 21:40:52,367 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-01-28 21:40:52,368 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-01-28 21:40:52,368 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-01-28 21:40:52,368 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-01-28 21:40:52,368 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:40:52,368 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 21:40:52,368 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 21:40:52,368 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:40:52,368 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:40:52,368 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:40:52,368 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-28 21:40:52,368 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-28 21:40:52,369 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 21:40:52,369 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 21:40:52,369 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-28 21:40:52,369 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-28 21:40:52,369 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-01-28 21:40:52,369 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:40:52,369 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-01-28 21:40:52,369 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-01-28 21:40:52,369 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-01-28 21:40:52,370 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-01-28 21:40:52,370 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-01-28 21:40:52,370 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-01-28 21:40:52,370 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-01-28 21:40:52,370 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-01-28 21:40:52,370 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-01-28 21:40:52,370 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-01-28 21:40:52,370 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-01-28 21:40:52,370 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:40:52,370 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:40:52,370 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:40:52,797 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-28 21:40:53,062 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:40:53,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:40:53 BoogieIcfgContainer [2018-01-28 21:40:53,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:40:53,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:40:53,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:40:53,078 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:40:53,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:40:52" (1/3) ... [2018-01-28 21:40:53,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386c3186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:40:53, skipping insertion in model container [2018-01-28 21:40:53,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:40:52" (2/3) ... [2018-01-28 21:40:53,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386c3186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:40:53, skipping insertion in model container [2018-01-28 21:40:53,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:40:53" (3/3) ... [2018-01-28 21:40:53,081 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_true-valid-memsafety.i [2018-01-28 21:40:53,090 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:40:53,097 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations. [2018-01-28 21:40:53,143 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:40:53,143 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:40:53,143 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:40:53,144 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:40:53,144 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:40:53,144 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:40:53,144 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:40:53,144 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:40:53,144 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:40:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states. [2018-01-28 21:40:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-28 21:40:53,171 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:40:53,172 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-28 21:40:53,172 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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-28 21:40:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash 501534486, now seen corresponding path program 1 times [2018-01-28 21:40:53,177 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:40:53,177 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:40:53,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:53,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:53,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:40:53,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:40:53,397 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-28 21:40:53,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:40:53,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:40:53,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:40:53,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:40:53,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:40:53,418 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 3 states. [2018-01-28 21:40:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:40:53,828 INFO L93 Difference]: Finished difference Result 726 states and 869 transitions. [2018-01-28 21:40:53,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:40:53,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-28 21:40:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:40:53,848 INFO L225 Difference]: With dead ends: 726 [2018-01-28 21:40:53,848 INFO L226 Difference]: Without dead ends: 426 [2018-01-28 21:40:53,855 INFO L533 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-28 21:40:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-01-28 21:40:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 381. [2018-01-28 21:40:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-01-28 21:40:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 459 transitions. [2018-01-28 21:40:53,927 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 459 transitions. Word has length 5 [2018-01-28 21:40:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:40:53,927 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 459 transitions. [2018-01-28 21:40:53,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:40:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 459 transitions. [2018-01-28 21:40:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-28 21:40:53,928 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:40:53,928 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-28 21:40:53,928 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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-28 21:40:53,928 INFO L82 PathProgramCache]: Analyzing trace with hash 501534487, now seen corresponding path program 1 times [2018-01-28 21:40:53,929 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:40:53,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:40:53,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:53,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:53,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:40:53,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:40:53,995 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-28 21:40:53,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:40:53,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:40:53,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:40:53,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:40:53,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:40:53,997 INFO L87 Difference]: Start difference. First operand 381 states and 459 transitions. Second operand 3 states. [2018-01-28 21:40:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:40:54,116 INFO L93 Difference]: Finished difference Result 390 states and 471 transitions. [2018-01-28 21:40:54,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:40:54,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-28 21:40:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:40:54,120 INFO L225 Difference]: With dead ends: 390 [2018-01-28 21:40:54,120 INFO L226 Difference]: Without dead ends: 389 [2018-01-28 21:40:54,121 INFO L533 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-28 21:40:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-28 21:40:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 380. [2018-01-28 21:40:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-01-28 21:40:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 458 transitions. [2018-01-28 21:40:54,150 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 458 transitions. Word has length 5 [2018-01-28 21:40:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:40:54,151 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 458 transitions. [2018-01-28 21:40:54,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:40:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 458 transitions. [2018-01-28 21:40:54,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:40:54,152 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:40:54,152 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:40:54,152 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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-28 21:40:54,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1576455808, now seen corresponding path program 1 times [2018-01-28 21:40:54,152 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:40:54,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:40:54,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:54,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:54,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:54,174 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:40:54,174 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:40:54,175 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-28 21:40:54,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:40:54,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:40:54,256 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-28 21:40:54,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:40:54,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:40:54,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:40:54,267 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-28 21:40:54,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:40:54,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:40:54,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:40:54,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:40:54,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:40:54,288 INFO L87 Difference]: Start difference. First operand 380 states and 458 transitions. Second operand 4 states. [2018-01-28 21:40:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:40:54,479 INFO L93 Difference]: Finished difference Result 380 states and 458 transitions. [2018-01-28 21:40:54,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:40:54,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 21:40:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:40:54,482 INFO L225 Difference]: With dead ends: 380 [2018-01-28 21:40:54,482 INFO L226 Difference]: Without dead ends: 379 [2018-01-28 21:40:54,483 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-28 21:40:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-01-28 21:40:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-01-28 21:40:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-01-28 21:40:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 457 transitions. [2018-01-28 21:40:54,509 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 457 transitions. Word has length 19 [2018-01-28 21:40:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:40:54,509 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 457 transitions. [2018-01-28 21:40:54,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:40:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 457 transitions. [2018-01-28 21:40:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:40:54,510 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:40:54,511 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:40:54,511 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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-28 21:40:54,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1576455807, now seen corresponding path program 1 times [2018-01-28 21:40:54,512 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:40:54,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:40:54,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:54,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:54,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:54,529 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:40:54,529 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:40:54,529 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-28 21:40:54,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:40:54,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:40:54,568 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-28 21:40:54,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:40:54,587 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-28 21:40:54,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:40:54,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:40:54,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-01-28 21:40:54,635 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-28 21:40:54,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:40:54,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:40:54,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:40:54,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:40:54,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:40:54,655 INFO L87 Difference]: Start difference. First operand 379 states and 457 transitions. Second operand 4 states. [2018-01-28 21:40:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:40:54,909 INFO L93 Difference]: Finished difference Result 379 states and 457 transitions. [2018-01-28 21:40:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:40:54,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 21:40:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:40:54,912 INFO L225 Difference]: With dead ends: 379 [2018-01-28 21:40:54,912 INFO L226 Difference]: Without dead ends: 378 [2018-01-28 21:40:54,913 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-28 21:40:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-01-28 21:40:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-01-28 21:40:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-01-28 21:40:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 456 transitions. [2018-01-28 21:40:54,931 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 456 transitions. Word has length 19 [2018-01-28 21:40:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:40:54,932 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 456 transitions. [2018-01-28 21:40:54,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:40:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 456 transitions. [2018-01-28 21:40:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-28 21:40:54,937 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:40:54,937 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2018-01-28 21:40:54,938 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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-28 21:40:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash -864286743, now seen corresponding path program 1 times [2018-01-28 21:40:54,938 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:40:54,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:40:54,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:54,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:54,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:54,973 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:40:54,974 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:40:54,974 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-28 21:40:54,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:40:55,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:40:55,121 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-28 21:40:55,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:40:55,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:40:55,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:40:55,263 WARN L1033 $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-28 21:40:55,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:40:55,272 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-28 21:40:55,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:40:55,289 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-28 21:40:55,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-28 21:40:55,316 WARN L1033 $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-28 21:40:55,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:40:55,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:40:55,341 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-28 21:40:55,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:40:55,350 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-28 21:40:55,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-01-28 21:40:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 12 not checked. [2018-01-28 21:40:55,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:40:55,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-01-28 21:40:55,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 21:40:55,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 21:40:55,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-01-28 21:40:55,475 INFO L87 Difference]: Start difference. First operand 378 states and 456 transitions. Second operand 15 states. [2018-01-28 21:40:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:40:56,930 INFO L93 Difference]: Finished difference Result 556 states and 671 transitions. [2018-01-28 21:40:56,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 21:40:56,936 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 178 [2018-01-28 21:40:56,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:40:56,941 INFO L225 Difference]: With dead ends: 556 [2018-01-28 21:40:56,941 INFO L226 Difference]: Without dead ends: 554 [2018-01-28 21:40:56,942 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 163 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=383, Unknown=2, NotChecked=82, Total=552 [2018-01-28 21:40:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-01-28 21:40:56,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 425. [2018-01-28 21:40:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-01-28 21:40:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 535 transitions. [2018-01-28 21:40:56,974 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 535 transitions. Word has length 178 [2018-01-28 21:40:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:40:56,975 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 535 transitions. [2018-01-28 21:40:56,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 21:40:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 535 transitions. [2018-01-28 21:40:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-01-28 21:40:56,978 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:40:56,978 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2018-01-28 21:40:56,978 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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-28 21:40:56,979 INFO L82 PathProgramCache]: Analyzing trace with hash -864286742, now seen corresponding path program 1 times [2018-01-28 21:40:56,979 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:40:56,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:40:56,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:56,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:56,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:56,999 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:40:56,999 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:40:56,999 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-28 21:40:57,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:40:57,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:40:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-01-28 21:40:57,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:40:57,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:40:57,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:40:57,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:40:57,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:40:57,390 INFO L87 Difference]: Start difference. First operand 425 states and 535 transitions. Second operand 9 states. [2018-01-28 21:40:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:40:58,097 INFO L93 Difference]: Finished difference Result 857 states and 1088 transitions. [2018-01-28 21:40:58,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:40:58,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2018-01-28 21:40:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:40:58,101 INFO L225 Difference]: With dead ends: 857 [2018-01-28 21:40:58,101 INFO L226 Difference]: Without dead ends: 428 [2018-01-28 21:40:58,102 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:40:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-01-28 21:40:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2018-01-28 21:40:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-01-28 21:40:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 536 transitions. [2018-01-28 21:40:58,122 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 536 transitions. Word has length 178 [2018-01-28 21:40:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:40:58,122 INFO L432 AbstractCegarLoop]: Abstraction has 426 states and 536 transitions. [2018-01-28 21:40:58,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:40:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 536 transitions. [2018-01-28 21:40:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-01-28 21:40:58,125 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:40:58,126 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2018-01-28 21:40:58,126 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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-28 21:40:58,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1541669202, now seen corresponding path program 1 times [2018-01-28 21:40:58,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:40:58,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:40:58,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:58,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:58,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:58,144 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:40:58,144 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:40:58,144 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 21:40:58,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:40:58,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:40:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 115 proven. 1 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-01-28 21:40:58,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:40:58,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-01-28 21:40:58,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:40:58,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:40:58,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:40:58,564 INFO L87 Difference]: Start difference. First operand 426 states and 536 transitions. Second operand 11 states. [2018-01-28 21:40:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:40:58,716 INFO L93 Difference]: Finished difference Result 861 states and 1092 transitions. [2018-01-28 21:40:58,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:40:58,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 196 [2018-01-28 21:40:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:40:58,720 INFO L225 Difference]: With dead ends: 861 [2018-01-28 21:40:58,720 INFO L226 Difference]: Without dead ends: 431 [2018-01-28 21:40:58,722 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:40:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-01-28 21:40:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2018-01-28 21:40:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-01-28 21:40:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 539 transitions. [2018-01-28 21:40:58,741 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 539 transitions. Word has length 196 [2018-01-28 21:40:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:40:58,741 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 539 transitions. [2018-01-28 21:40:58,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:40:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 539 transitions. [2018-01-28 21:40:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-01-28 21:40:58,745 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:40:58,745 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2018-01-28 21:40:58,745 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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-28 21:40:58,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1001003158, now seen corresponding path program 2 times [2018-01-28 21:40:58,746 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:40:58,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:40:58,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:58,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:40:58,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:40:58,764 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:40:58,764 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:40:58,764 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-28 21:40:58,771 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:40:58,808 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:40:58,852 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:41:00,679 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:41:00,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:41:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 151 proven. 96 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-01-28 21:41:00,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:41:00,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-01-28 21:41:00,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 21:41:00,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 21:41:00,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:41:00,941 INFO L87 Difference]: Start difference. First operand 429 states and 539 transitions. Second operand 13 states. [2018-01-28 21:41:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:41:01,108 INFO L93 Difference]: Finished difference Result 867 states and 1098 transitions. [2018-01-28 21:41:01,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 21:41:01,110 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 214 [2018-01-28 21:41:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:41:01,112 INFO L225 Difference]: With dead ends: 867 [2018-01-28 21:41:01,113 INFO L226 Difference]: Without dead ends: 434 [2018-01-28 21:41:01,114 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-01-28 21:41:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-01-28 21:41:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 432. [2018-01-28 21:41:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-01-28 21:41:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 542 transitions. [2018-01-28 21:41:01,131 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 542 transitions. Word has length 214 [2018-01-28 21:41:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:41:01,131 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 542 transitions. [2018-01-28 21:41:01,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 21:41:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 542 transitions. [2018-01-28 21:41:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-01-28 21:41:01,135 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:41:01,135 INFO L330 BasicCegarLoop]: trace histogram [18, 18, 18, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2018-01-28 21:41:01,135 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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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-28 21:41:01,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1846166482, now seen corresponding path program 3 times [2018-01-28 21:41:01,135 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:41:01,136 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:41:01,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:41:01,137 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:41:01,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:41:01,150 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:41:01,150 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:41:01,150 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-28 21:41:01,158 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:41:01,196 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:41:01,206 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:41:01,222 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:41:01,299 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:41:01,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:41:01,380 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 33 treesize of output 32 [2018-01-28 21:41:01,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:01,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 36 treesize of output 35 [2018-01-28 21:41:01,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:01,667 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 32 treesize of output 31 [2018-01-28 21:41:01,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:01,683 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 35 treesize of output 34 [2018-01-28 21:41:01,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:01,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:41:01,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-01-28 21:41:04,325 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 23 treesize of output 18 [2018-01-28 21:41:04,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:04,347 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 18 treesize of output 17 [2018-01-28 21:41:04,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:04,370 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-28 21:41:04,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:04,393 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-28 21:41:04,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:04,414 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-28 21:41:04,414 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-01-28 21:41:07,292 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_26 Int) (v_prenex_25 Int) (v_prenex_24 Int)) (and (<= (mod (* v_prenex_25 v_prenex_26) 4294967296) 2147483647) (= (mod (* v_prenex_26 v_prenex_25) 4294967296) (select |c_#length| v_prenex_24)))) (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (v_calloc_model_~nmemb_BEFORE_CALL_5 Int) (v_calloc_model_~size_BEFORE_CALL_5 Int)) (and (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296) (mod (* v_calloc_model_~size_BEFORE_CALL_5 v_calloc_model_~nmemb_BEFORE_CALL_5) 4294967296)) (< 2147483647 (mod (* v_calloc_model_~nmemb_BEFORE_CALL_5 v_calloc_model_~size_BEFORE_CALL_5) 4294967296))))) is different from true [2018-01-28 21:41:11,349 WARN L143 SmtUtils]: Spent 4020ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-28 21:41:14,442 WARN L143 SmtUtils]: Spent 3063ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-28 21:41:14,824 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse0 (mod v_prenex_41 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_42)) (<= .cse0 2147483647) (= |c_#length| (store |c_old(#length)| v_prenex_42 .cse0)) (<= 1 .cse0)))) is different from true [2018-01-28 21:41:14,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:41:14,839 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 14 treesize of output 17 [2018-01-28 21:41:14,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:14,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:41:14,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:41:14,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:41:14,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:14,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:41:14,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:30 [2018-01-28 21:41:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 443 proven. 49 refuted. 1 times theorem prover too weak. 410 trivial. 9 not checked. [2018-01-28 21:41:15,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:41:15,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-01-28 21:41:15,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 21:41:15,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 21:41:15,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=8, NotChecked=94, Total=702 [2018-01-28 21:41:15,380 INFO L87 Difference]: Start difference. First operand 432 states and 542 transitions. Second operand 27 states. [2018-01-28 21:41:19,464 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 65 DAG size of output 56 [2018-01-28 21:41:23,900 WARN L146 SmtUtils]: Spent 4005ms on a formula simplification. DAG size of input: 82 DAG size of output 41 [2018-01-28 21:41:30,962 WARN L146 SmtUtils]: Spent 6978ms on a formula simplification. DAG size of input: 89 DAG size of output 48 [2018-01-28 21:41:42,344 WARN L143 SmtUtils]: Spent 4078ms on a formula simplification that was a NOOP. DAG size: 50 [2018-01-28 21:41:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:41:50,408 INFO L93 Difference]: Finished difference Result 624 states and 748 transitions. [2018-01-28 21:41:50,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 21:41:50,409 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 232 [2018-01-28 21:41:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:41:50,414 INFO L225 Difference]: With dead ends: 624 [2018-01-28 21:41:50,414 INFO L226 Difference]: Without dead ends: 622 [2018-01-28 21:41:50,415 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=213, Invalid=1674, Unknown=13, NotChecked=170, Total=2070 [2018-01-28 21:41:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-01-28 21:41:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 515. [2018-01-28 21:41:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-01-28 21:41:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 675 transitions. [2018-01-28 21:41:50,462 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 675 transitions. Word has length 232 [2018-01-28 21:41:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:41:50,463 INFO L432 AbstractCegarLoop]: Abstraction has 515 states and 675 transitions. [2018-01-28 21:41:50,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 21:41:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 675 transitions. [2018-01-28 21:41:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-01-28 21:41:50,466 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:41:50,467 INFO L330 BasicCegarLoop]: trace histogram [18, 18, 18, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:41:50,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, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, 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-28 21:41:50,467 INFO L82 PathProgramCache]: Analyzing trace with hash -344487026, now seen corresponding path program 1 times [2018-01-28 21:41:50,467 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:41:50,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:41:50,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:41:50,468 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:41:50,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:41:50,484 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 21:41:50,484 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 21:41:50,484 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-28 21:41:50,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:41:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:41:50,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:41:50,647 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-28 21:41:50,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:50,665 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-28 21:41:50,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:50,667 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 26 treesize of output 25 [2018-01-28 21:41:50,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:50,685 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-28 21:41:50,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:50,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:41:50,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-01-28 21:41:51,478 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= (store |c_old(#length)| |calloc_model_#t~malloc0.base| (+ (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296) (- 4294967296))) |c_#length|) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296)))) (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse0 (mod (* v_prenex_59 v_prenex_57) 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_58 .cse0)) (= 0 (select |c_old(#valid)| v_prenex_58)) (<= .cse0 2147483647))))) is different from true [2018-01-28 21:41:51,485 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 23 treesize of output 18 [2018-01-28 21:41:51,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:51,515 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 18 treesize of output 17 [2018-01-28 21:41:51,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:51,558 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 25 treesize of output 20 [2018-01-28 21:41:51,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:51,591 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 20 treesize of output 19 [2018-01-28 21:41:51,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:41:51,619 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-28 21:41:51,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-01-28 21:41:53,634 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= (+ (select |c_#length| |calloc_model_#t~malloc0.base|) 4294967296) (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296)) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296)))) (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse0 (mod (* v_prenex_59 v_prenex_57) 4294967296))) (and (= (select |c_#length| v_prenex_58) .cse0) (<= .cse0 2147483647))))) is different from true [2018-01-28 21:41:53,665 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= (+ (select |c_#length| |calloc_model_#t~malloc0.base|) 4294967296) (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296)) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296))))) (.cse2 (exists ((v_prenex_67 Int) (v_prenex_63 Int) (v_prenex_65 Int)) (let ((.cse5 (mod (* v_prenex_67 v_prenex_63) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_65)) (< 2147483647 .cse5) (= |c_#length| (store |c_old(#length)| v_prenex_65 (+ .cse5 (- 4294967296)))))))) (.cse3 (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse4 (mod (* v_prenex_59 v_prenex_57) 4294967296))) (and (= (select |c_#length| v_prenex_58) .cse4) (<= .cse4 2147483647))))) (.cse1 (exists ((v_prenex_66 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (and (= (store |c_old(#length)| v_prenex_64 (mod (* v_prenex_66 v_prenex_62) 4294967296)) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_64)) (<= (mod (* v_prenex_62 v_prenex_66) 4294967296) 2147483647))))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse2) (and .cse3 .cse1))) is different from true [2018-01-28 21:41:55,682 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= (+ (select |c_#length| |calloc_model_#t~malloc0.base|) 4294967296) (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296)) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296)))) (exists ((v_prenex_66 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (and (= (store |c_old(#length)| v_prenex_64 (mod (* v_prenex_66 v_prenex_62) 4294967296)) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_64)) (<= (mod (* v_prenex_62 v_prenex_66) 4294967296) 2147483647)))) (and (exists ((v_prenex_77 Int) (v_prenex_74 Int) (v_prenex_76 Int)) (let ((.cse0 (mod (* v_prenex_74 v_prenex_77) 4294967296))) (and (<= .cse0 2147483647) (= (select |c_#length| v_prenex_76) .cse0)))) (exists ((v_prenex_78 Int) (v_prenex_79 Int) (v_prenex_75 Int)) (let ((.cse1 (mod (* v_prenex_78 v_prenex_75) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_79)) (<= .cse1 2147483647) (= |c_#length| (store |c_old(#length)| v_prenex_79 .cse1)))))) (and (exists ((v_prenex_67 Int) (v_prenex_63 Int) (v_prenex_65 Int)) (let ((.cse2 (mod (* v_prenex_67 v_prenex_63) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_65)) (< 2147483647 .cse2) (= |c_#length| (store |c_old(#length)| v_prenex_65 (+ .cse2 (- 4294967296))))))) (exists ((v_prenex_69 Int) (v_prenex_68 Int) (v_prenex_70 Int)) (and (< 2147483647 (mod (* v_prenex_70 v_prenex_68) 4294967296)) (= (+ (select |c_#length| v_prenex_69) 4294967296) (mod (* v_prenex_68 v_prenex_70) 4294967296))))) (and (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse3 (mod (* v_prenex_59 v_prenex_57) 4294967296))) (and (= (select |c_#length| v_prenex_58) .cse3) (<= .cse3 2147483647)))) (exists ((v_prenex_73 Int) (v_prenex_72 Int) (v_prenex_71 Int)) (and (< 2147483647 (mod (* v_prenex_71 v_prenex_72) 4294967296)) (= (store |c_old(#length)| v_prenex_73 (+ (mod (* v_prenex_72 v_prenex_71) 4294967296) (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_73)))))) is different from true [2018-01-28 21:41:55,711 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_77 Int) (v_prenex_74 Int) (v_prenex_76 Int)) (let ((.cse0 (mod (* v_prenex_74 v_prenex_77) 4294967296))) (and (<= .cse0 2147483647) (= (select |c_#length| v_prenex_76) .cse0)))) (exists ((v_prenex_78 Int) (v_prenex_79 Int) (v_prenex_75 Int)) (let ((.cse1 (mod (* v_prenex_78 v_prenex_75) 4294967296))) (and (<= .cse1 2147483647) (= (select |c_old(#valid)| v_prenex_79) 0) (= |c_#length| (store |c_old(#length)| v_prenex_79 .cse1)))))) (and (exists ((v_prenex_67 Int) (v_prenex_63 Int) (v_prenex_65 Int)) (let ((.cse2 (mod (* v_prenex_67 v_prenex_63) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_65)) (< 2147483647 .cse2) (= |c_#length| (store |c_old(#length)| v_prenex_65 (+ .cse2 (- 4294967296))))))) (exists ((v_prenex_69 Int) (v_prenex_68 Int) (v_prenex_70 Int)) (and (< 2147483647 (mod (* v_prenex_70 v_prenex_68) 4294967296)) (= (+ (select |c_#length| v_prenex_69) 4294967296) (mod (* v_prenex_68 v_prenex_70) 4294967296))))) (and (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse3 (mod (* v_prenex_59 v_prenex_57) 4294967296))) (and (= (select |c_#length| v_prenex_58) .cse3) (<= .cse3 2147483647)))) (exists ((v_prenex_73 Int) (v_prenex_72 Int) (v_prenex_71 Int)) (and (< 2147483647 (mod (* v_prenex_71 v_prenex_72) 4294967296)) (= (store |c_old(#length)| v_prenex_73 (+ (mod (* v_prenex_72 v_prenex_71) 4294967296) (- 4294967296))) |c_#length|) (= (select |c_old(#valid)| v_prenex_73) 0)))) (and (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= (+ (select |c_#length| |calloc_model_#t~malloc0.base|) 4294967296) (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296)) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296)))) (exists ((v_prenex_66 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (and (= (store |c_old(#length)| v_prenex_64 (mod (* v_prenex_66 v_prenex_62) 4294967296)) |c_#length|) (= (select |c_old(#valid)| v_prenex_64) 0) (<= (mod (* v_prenex_62 v_prenex_66) 4294967296) 2147483647))))) is different from true [2018-01-28 21:41:55,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:41:55,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:41:55,767 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 67 treesize of output 61 [2018-01-28 21:41:55,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:42:16,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:42:16,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:42:16,123 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 64 treesize of output 58 [2018-01-28 21:42:16,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:42:36,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:42:36,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:42:36,024 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 64 treesize of output 77 [2018-01-28 21:42:36,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:42:55,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:42:55,709 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 64 treesize of output 67 [2018-01-28 21:42:55,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:09,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:09,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:43:09,451 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 62 treesize of output 56 [2018-01-28 21:43:09,452 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:43:24,877 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 56 treesize of output 55 [2018-01-28 21:43:24,878 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-01-28 21:43:29,580 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-28 21:43:29,580 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 21:43:29,586 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 21:43:29,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:43:29 BoogieIcfgContainer [2018-01-28 21:43:29,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:43:29,587 INFO L168 Benchmark]: Toolchain (without parser) took 157561.11 ms. Allocated memory was 308.8 MB in the beginning and 643.8 MB in the end (delta: 335.0 MB). Free memory was 268.8 MB in the beginning and 307.6 MB in the end (delta: -38.7 MB). Peak memory consumption was 296.3 MB. Max. memory is 5.3 GB. [2018-01-28 21:43:29,588 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:43:29,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.29 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 254.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:43:29,589 INFO L168 Benchmark]: Boogie Preprocessor took 41.85 ms. Allocated memory is still 308.8 MB. Free memory was 254.9 MB in the beginning and 252.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:43:29,589 INFO L168 Benchmark]: RCFGBuilder took 745.34 ms. Allocated memory is still 308.8 MB. Free memory was 252.8 MB in the beginning and 191.5 MB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 5.3 GB. [2018-01-28 21:43:29,590 INFO L168 Benchmark]: TraceAbstraction took 156512.36 ms. Allocated memory was 328.2 MB in the beginning and 643.8 MB in the end (delta: 315.6 MB). Free memory was 296.9 MB in the beginning and 307.6 MB in the end (delta: -10.7 MB). Peak memory consumption was 304.9 MB. Max. memory is 5.3 GB. [2018-01-28 21:43:29,592 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.18 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 242.29 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 254.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.85 ms. Allocated memory is still 308.8 MB. Free memory was 254.9 MB in the beginning and 252.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 745.34 ms. Allocated memory is still 308.8 MB. Free memory was 252.8 MB in the beginning and 191.5 MB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 156512.36 ms. Allocated memory was 328.2 MB in the beginning and 643.8 MB in the end (delta: 315.6 MB). Free memory was 296.9 MB in the beginning and 307.6 MB in the end (delta: -10.7 MB). Peak memory consumption was 304.9 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 analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 262. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 305 locations, 83 error locations. TIMEOUT Result, 156.4s OverallTime, 10 OverallIterations, 18 TraceHistogramMax, 38.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2613 SDtfs, 1508 SDslu, 11675 SDs, 0 SdLazy, 6944 SolverSat, 216 SolverUnsat, 51 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1077 GetRequests, 963 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 33.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=515occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 296 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 914 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1037 ConstructedInterpolants, 66 QuantifiedInterpolants, 920933 SizeOfPredicates, 52 NumberOfNonLiveVariables, 3557 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 2475/2643 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-43-29-602.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-43-29-602.csv Completed graceful shutdown