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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0235_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:43:16,055 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:43:16,056 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:43:16,067 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:43:16,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:43:16,068 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:43:16,069 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:43:16,071 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:43:16,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:43:16,073 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:43:16,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:43:16,073 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:43:16,074 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:43:16,075 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:43:16,076 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:43:16,077 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:43:16,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:43:16,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:43:16,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:43:16,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:43:16,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:43:16,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:43:16,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:43:16,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:43:16,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:43:16,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:43:16,087 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:43:16,087 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:43:16,087 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:43:16,087 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:43:16,088 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:43:16,088 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:43:16,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:43:16,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:43:16,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:43:16,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:43:16,098 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:43:16,099 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:43:16,099 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:43:16,099 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:43:16,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:43:16,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:43:16,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:43:16,099 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:43:16,099 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:43:16,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:43:16,099 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:43:16,100 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:43:16,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:43:16,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:43:16,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:43:16,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:43:16,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:43:16,100 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:43:16,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:43:16,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:43:16,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:43:16,132 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:43:16,135 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:43:16,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:43:16,136 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:43:16,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_true-valid-memsafety.i [2018-02-04 12:43:16,282 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:43:16,283 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:43:16,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:43:16,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:43:16,288 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:43:16,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:43:16" (1/1) ... [2018-02-04 12:43:16,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ec44b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:43:16, skipping insertion in model container [2018-02-04 12:43:16,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:43:16" (1/1) ... [2018-02-04 12:43:16,300 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:43:16,331 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:43:16,426 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:43:16,448 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:43:16,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:43:16 WrapperNode [2018-02-04 12:43:16,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:43:16,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:43:16,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:43:16,459 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:43:16,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:43:16" (1/1) ... [2018-02-04 12:43:16,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:43:16" (1/1) ... [2018-02-04 12:43:16,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:43:16" (1/1) ... [2018-02-04 12:43:16,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:43:16" (1/1) ... [2018-02-04 12:43:16,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:43:16" (1/1) ... [2018-02-04 12:43:16,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:43:16" (1/1) ... [2018-02-04 12:43:16,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:43:16" (1/1) ... [2018-02-04 12:43:16,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:43:16,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:43:16,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:43:16,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:43:16,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:43:16" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:43:16,534 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:43:16,534 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 12:43:16,535 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 12:43:16,536 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 12:43:16,536 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:43:16,537 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:43:16,805 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 12:43:16,999 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:43:17,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:43:17 BoogieIcfgContainer [2018-02-04 12:43:17,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:43:17,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:43:17,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:43:17,002 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:43:17,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:43:16" (1/3) ... [2018-02-04 12:43:17,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fb2df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:43:17, skipping insertion in model container [2018-02-04 12:43:17,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:43:16" (2/3) ... [2018-02-04 12:43:17,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fb2df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:43:17, skipping insertion in model container [2018-02-04 12:43:17,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:43:17" (3/3) ... [2018-02-04 12:43:17,004 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_true-valid-memsafety.i [2018-02-04 12:43:17,010 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:43:17,015 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations. [2018-02-04 12:43:17,047 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:43:17,047 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:43:17,047 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:43:17,047 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:43:17,047 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:43:17,047 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:43:17,048 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:43:17,048 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:43:17,048 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:43:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2018-02-04 12:43:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:43:17,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:43:17,071 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:43:17,071 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-02-04 12:43:17,076 INFO L82 PathProgramCache]: Analyzing trace with hash 15106047, now seen corresponding path program 1 times [2018-02-04 12:43:17,077 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:43:17,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:43:17,112 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:17,112 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:17,112 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:43:17,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:43:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:43:17,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:43:17,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:43:17,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:43:17,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:43:17,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:43:17,303 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 3 states. [2018-02-04 12:43:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:43:17,446 INFO L93 Difference]: Finished difference Result 277 states and 310 transitions. [2018-02-04 12:43:17,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:43:17,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:43:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:43:17,456 INFO L225 Difference]: With dead ends: 277 [2018-02-04 12:43:17,456 INFO L226 Difference]: Without dead ends: 274 [2018-02-04 12:43:17,458 INFO L554 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-02-04 12:43:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-04 12:43:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2018-02-04 12:43:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-04 12:43:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 296 transitions. [2018-02-04 12:43:17,501 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 296 transitions. Word has length 4 [2018-02-04 12:43:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:43:17,501 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 296 transitions. [2018-02-04 12:43:17,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:43:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 296 transitions. [2018-02-04 12:43:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:43:17,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:43:17,502 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:43:17,502 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-02-04 12:43:17,503 INFO L82 PathProgramCache]: Analyzing trace with hash 15106046, now seen corresponding path program 1 times [2018-02-04 12:43:17,503 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:43:17,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:43:17,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:17,504 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:17,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:43:17,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:43:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:43:17,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:43:17,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:43:17,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:43:17,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:43:17,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:43:17,545 INFO L87 Difference]: Start difference. First operand 266 states and 296 transitions. Second operand 3 states. [2018-02-04 12:43:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:43:17,702 INFO L93 Difference]: Finished difference Result 382 states and 436 transitions. [2018-02-04 12:43:17,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:43:17,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:43:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:43:17,704 INFO L225 Difference]: With dead ends: 382 [2018-02-04 12:43:17,704 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 12:43:17,705 INFO L554 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-02-04 12:43:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 12:43:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 337. [2018-02-04 12:43:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-02-04 12:43:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 415 transitions. [2018-02-04 12:43:17,724 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 415 transitions. Word has length 4 [2018-02-04 12:43:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:43:17,724 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 415 transitions. [2018-02-04 12:43:17,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:43:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 415 transitions. [2018-02-04 12:43:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:43:17,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:43:17,725 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:43:17,726 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-02-04 12:43:17,726 INFO L82 PathProgramCache]: Analyzing trace with hash -416211489, now seen corresponding path program 1 times [2018-02-04 12:43:17,726 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:43:17,726 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:43:17,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:17,727 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:17,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:17,741 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:43:17,741 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:43:17,742 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:43:17,750 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:43:17,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:43:17,810 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-02-04 12:43:17,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:17,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:43:17,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:43:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:43:17,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:43:17,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:43:17,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:43:17,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:43:17,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:43:17,839 INFO L87 Difference]: Start difference. First operand 337 states and 415 transitions. Second operand 4 states. [2018-02-04 12:43:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:43:17,970 INFO L93 Difference]: Finished difference Result 336 states and 414 transitions. [2018-02-04 12:43:17,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:43:17,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 12:43:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:43:17,973 INFO L225 Difference]: With dead ends: 336 [2018-02-04 12:43:17,973 INFO L226 Difference]: Without dead ends: 336 [2018-02-04 12:43:17,973 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:43:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-04 12:43:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2018-02-04 12:43:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-04 12:43:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 414 transitions. [2018-02-04 12:43:17,985 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 414 transitions. Word has length 17 [2018-02-04 12:43:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:43:17,985 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 414 transitions. [2018-02-04 12:43:17,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:43:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 414 transitions. [2018-02-04 12:43:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:43:17,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:43:17,986 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:43:17,986 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-02-04 12:43:17,987 INFO L82 PathProgramCache]: Analyzing trace with hash -416211488, now seen corresponding path program 1 times [2018-02-04 12:43:17,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:43:17,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:43:17,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:17,988 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:17,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:18,002 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:43:18,002 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:43:18,002 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:43:18,007 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:43:18,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:43:18,048 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-02-04 12:43:18,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:18,064 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-02-04 12:43:18,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:18,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:43:18,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-04 12:43:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:43:18,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:43:18,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:43:18,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:43:18,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:43:18,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:43:18,136 INFO L87 Difference]: Start difference. First operand 336 states and 414 transitions. Second operand 4 states. [2018-02-04 12:43:18,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:43:18,324 INFO L93 Difference]: Finished difference Result 335 states and 413 transitions. [2018-02-04 12:43:18,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:43:18,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 12:43:18,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:43:18,326 INFO L225 Difference]: With dead ends: 335 [2018-02-04 12:43:18,326 INFO L226 Difference]: Without dead ends: 335 [2018-02-04 12:43:18,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:43:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-02-04 12:43:18,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-02-04 12:43:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-04 12:43:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 413 transitions. [2018-02-04 12:43:18,341 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 413 transitions. Word has length 17 [2018-02-04 12:43:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:43:18,341 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 413 transitions. [2018-02-04 12:43:18,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:43:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 413 transitions. [2018-02-04 12:43:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 12:43:18,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:43:18,344 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:43:18,344 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-02-04 12:43:18,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1095590031, now seen corresponding path program 1 times [2018-02-04 12:43:18,345 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:43:18,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:43:18,346 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:18,346 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:18,346 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:18,362 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:43:18,362 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:43:18,362 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:43:18,369 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:43:18,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:43:18,468 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-02-04 12:43:18,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:18,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:43:18,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:43:18,523 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-02-04 12:43:18,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:18,528 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-02-04 12:43:18,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:18,529 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-02-04 12:43:18,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 12:43:18,537 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~0.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~0.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-02-04 12:43:18,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:18,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:18,551 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-02-04 12:43:18,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:18,560 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-02-04 12:43:18,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-04 12:43:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-02-04 12:43:18,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:43:18,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 12:43:18,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:43:18,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:43:18,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-04 12:43:18,636 INFO L87 Difference]: Start difference. First operand 335 states and 413 transitions. Second operand 15 states. [2018-02-04 12:43:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:43:19,505 INFO L93 Difference]: Finished difference Result 507 states and 622 transitions. [2018-02-04 12:43:19,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:43:19,505 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-04 12:43:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:43:19,509 INFO L225 Difference]: With dead ends: 507 [2018-02-04 12:43:19,509 INFO L226 Difference]: Without dead ends: 507 [2018-02-04 12:43:19,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-02-04 12:43:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-02-04 12:43:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 378. [2018-02-04 12:43:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-04 12:43:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 488 transitions. [2018-02-04 12:43:19,522 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 488 transitions. Word has length 142 [2018-02-04 12:43:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:43:19,523 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 488 transitions. [2018-02-04 12:43:19,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:43:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 488 transitions. [2018-02-04 12:43:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 12:43:19,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:43:19,525 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:43:19,526 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-02-04 12:43:19,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1095590030, now seen corresponding path program 1 times [2018-02-04 12:43:19,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:43:19,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:43:19,527 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:19,527 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:19,527 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:19,540 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:43:19,540 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:43:19,540 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:43:19,551 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:43:19,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:43:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 12:43:19,785 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:43:19,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:43:19,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:43:19,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:43:19,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:43:19,786 INFO L87 Difference]: Start difference. First operand 378 states and 488 transitions. Second operand 8 states. [2018-02-04 12:43:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:43:20,209 INFO L93 Difference]: Finished difference Result 388 states and 498 transitions. [2018-02-04 12:43:20,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:43:20,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-04 12:43:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:43:20,212 INFO L225 Difference]: With dead ends: 388 [2018-02-04 12:43:20,212 INFO L226 Difference]: Without dead ends: 379 [2018-02-04 12:43:20,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:43:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-04 12:43:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-02-04 12:43:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-04 12:43:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 489 transitions. [2018-02-04 12:43:20,221 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 489 transitions. Word has length 142 [2018-02-04 12:43:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:43:20,221 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 489 transitions. [2018-02-04 12:43:20,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:43:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 489 transitions. [2018-02-04 12:43:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-04 12:43:20,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:43:20,223 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:43:20,223 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-02-04 12:43:20,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1271552274, now seen corresponding path program 1 times [2018-02-04 12:43:20,224 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:43:20,224 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:43:20,224 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:20,225 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:20,225 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:20,236 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:43:20,236 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:43:20,236 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:43:20,244 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:43:20,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:43:20,522 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-04 12:43:20,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:43:20,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 12:43:20,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:43:20,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:43:20,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:43:20,541 INFO L87 Difference]: Start difference. First operand 379 states and 489 transitions. Second operand 9 states. [2018-02-04 12:43:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:43:20,639 INFO L93 Difference]: Finished difference Result 389 states and 499 transitions. [2018-02-04 12:43:20,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:43:20,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-04 12:43:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:43:20,646 INFO L225 Difference]: With dead ends: 389 [2018-02-04 12:43:20,646 INFO L226 Difference]: Without dead ends: 380 [2018-02-04 12:43:20,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:43:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-04 12:43:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-02-04 12:43:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-04 12:43:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 490 transitions. [2018-02-04 12:43:20,653 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 490 transitions. Word has length 148 [2018-02-04 12:43:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:43:20,653 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 490 transitions. [2018-02-04 12:43:20,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:43:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 490 transitions. [2018-02-04 12:43:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 12:43:20,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:43:20,655 INFO L351 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:43:20,655 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-02-04 12:43:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash -249451022, now seen corresponding path program 2 times [2018-02-04 12:43:20,655 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:43:20,656 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:43:20,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:20,656 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:43:20,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:20,666 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:43:20,666 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:43:20,666 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:43:20,674 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:43:22,252 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:43:22,252 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:43:22,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:43:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 263 proven. 38 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-04 12:43:22,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:43:22,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 12:43:22,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:43:22,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:43:22,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:43:22,410 INFO L87 Difference]: Start difference. First operand 380 states and 490 transitions. Second operand 10 states. [2018-02-04 12:43:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:43:22,825 INFO L93 Difference]: Finished difference Result 390 states and 500 transitions. [2018-02-04 12:43:22,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:43:22,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-04 12:43:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:43:22,827 INFO L225 Difference]: With dead ends: 390 [2018-02-04 12:43:22,827 INFO L226 Difference]: Without dead ends: 381 [2018-02-04 12:43:22,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:43:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-04 12:43:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-02-04 12:43:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-04 12:43:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 491 transitions. [2018-02-04 12:43:22,835 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 491 transitions. Word has length 154 [2018-02-04 12:43:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:43:22,835 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 491 transitions. [2018-02-04 12:43:22,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:43:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 491 transitions. [2018-02-04 12:43:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-04 12:43:22,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:43:22,837 INFO L351 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:43:22,837 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-02-04 12:43:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1814607250, now seen corresponding path program 3 times [2018-02-04 12:43:22,838 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:43:22,838 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:43:22,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:22,839 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:43:22,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:43:22,849 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:43:22,850 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:43:22,850 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:43:22,859 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:43:22,998 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 12:43:22,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:43:23,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:43:23,029 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-02-04 12:43:23,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:23,265 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-02-04 12:43:23,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:23,293 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-02-04 12:43:23,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:23,294 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-02-04 12:43:23,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:23,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:43:23,318 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-04 12:43:24,645 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-02-04 12:43:24,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:24,661 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-02-04 12:43:24,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:24,675 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-02-04 12:43:24,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:24,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-02-04 12:43:24,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:24,704 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-02-04 12:43:24,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-04 12:43:26,725 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_15 Int) (calloc_model_~size Int) (v_prenex_13 Int)) (let ((.cse0 (mod (* v_prenex_13 calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_prenex_15) 4294967296) .cse0) (< 2147483647 .cse0)))) (exists ((v_prenex_12 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse1 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| v_prenex_12) 4294967296))) (and (= .cse1 (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3)) (<= .cse1 2147483647))))) is different from true [2018-02-04 12:43:28,749 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_prenex_12 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse7 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| v_prenex_12) 4294967296))) (and (= .cse7 (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3)) (<= .cse7 2147483647))))) (.cse0 (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_18) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_17)) (= (store |c_old(#length)| v_prenex_17 (+ .cse6 (- 4294967296))) |c_#length|) (< 2147483647 .cse6))))) (.cse3 (exists ((v_prenex_15 Int) (calloc_model_~size Int) (v_prenex_13 Int)) (let ((.cse5 (mod (* v_prenex_13 calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_prenex_15) 4294967296) .cse5) (< 2147483647 .cse5))))) (.cse2 (exists ((calloc_model_~ptr~0.base Int) (v_prenex_19 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse4 2147483647) (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse4) |c_#length|)))))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse3 .cse2))) is different from true [2018-02-04 12:43:29,062 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse0 (mod (* |c_calloc_model_#in~nmemb| v_prenex_18) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_17)) (= (store |c_old(#length)| v_prenex_17 (+ .cse0 (- 4294967296))) |c_#length|) (< 2147483647 .cse0)))) (exists ((v_prenex_12 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse1 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| v_prenex_12) 4294967296))) (and (= .cse1 (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3)) (<= .cse1 2147483647))))) (and (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse2 (mod (* v_prenex_21 v_prenex_20) 4294967296))) (and (<= .cse2 2147483647) (= .cse2 (select |c_#length| v_prenex_22))))) (exists ((calloc_model_~ptr~0.base Int) (v_prenex_19 Int)) (let ((.cse3 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse3 2147483647) (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse3) |c_#length|))))) (and (exists ((v_prenex_15 Int) (calloc_model_~size Int) (v_prenex_13 Int)) (let ((.cse4 (mod (* v_prenex_13 calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_prenex_15) 4294967296) .cse4) (< 2147483647 .cse4)))) (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| v_prenex_23) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_24)) (= (store |c_old(#length)| v_prenex_24 (+ .cse5 (- 4294967296))) |c_#length|) (< 2147483647 .cse5))))) (and (exists ((v_prenex_29 Int) (v_prenex_28 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_29) 4294967296))) (and (<= .cse6 2147483647) (= |c_#length| (store |c_old(#length)| v_prenex_28 .cse6)) (= 0 (select |c_old(#valid)| v_prenex_28))))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse7 (mod (* v_prenex_27 v_prenex_26) 4294967296))) (and (< 2147483647 .cse7) (= (+ (select |c_#length| v_prenex_25) 4294967296) .cse7)))))) is different from true [2018-02-04 12:43:29,079 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_29 Int) (v_prenex_28 Int)) (let ((.cse0 (mod v_prenex_29 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_28 .cse0)) (<= .cse0 2147483647) (= (select |c_old(#valid)| v_prenex_28) 0)))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse1 (mod (* v_prenex_27 v_prenex_26) 4294967296))) (and (< 2147483647 .cse1) (= (+ (select |c_#length| v_prenex_25) 4294967296) .cse1))))) (and (exists ((v_prenex_12 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse2 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| v_prenex_12) 4294967296))) (and (= .cse2 (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3)) (<= .cse2 2147483647)))) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse3 (mod v_prenex_18 4294967296))) (and (= (select |c_old(#valid)| v_prenex_17) 0) (< 2147483647 .cse3) (= |c_#length| (store |c_old(#length)| v_prenex_17 (+ .cse3 (- 4294967296)))))))) (and (exists ((v_prenex_15 Int) (calloc_model_~size Int) (v_prenex_13 Int)) (let ((.cse4 (mod (* v_prenex_13 calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_prenex_15) 4294967296) .cse4) (< 2147483647 .cse4)))) (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse5 (mod v_prenex_23 4294967296))) (and (< 2147483647 .cse5) (= (store |c_old(#length)| v_prenex_24 (+ .cse5 (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_24)))))) (and (exists ((calloc_model_~ptr~0.base Int) (v_prenex_19 Int)) (let ((.cse6 (mod v_prenex_19 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse6) |c_#length|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse6 2147483647)))) (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse7 (mod (* v_prenex_21 v_prenex_20) 4294967296))) (and (<= .cse7 2147483647) (= .cse7 (select |c_#length| v_prenex_22))))))) is different from true [2018-02-04 12:43:29,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:29,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:29,099 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 50 treesize of output 44 [2018-02-04 12:43:29,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:29,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:29,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:29,314 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 48 treesize of output 42 [2018-02-04 12:43:29,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:29,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:29,479 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 44 treesize of output 53 [2018-02-04 12:43:29,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:29,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:29,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:29,628 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 52 treesize of output 46 [2018-02-04 12:43:29,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:29,809 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 42 treesize of output 41 [2018-02-04 12:43:29,810 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:29,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:29,969 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 46 treesize of output 55 [2018-02-04 12:43:29,970 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:30,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:30,115 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 50 treesize of output 53 [2018-02-04 12:43:30,116 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:30,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:30,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:43:30,243 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 49 treesize of output 43 [2018-02-04 12:43:30,244 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:43:30,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-02-04 12:43:30,362 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:201, output treesize:165 [2018-02-04 12:43:50,992 WARN L146 SmtUtils]: Spent 20579ms on a formula simplification. DAG size of input: 95 DAG size of output 64 [2018-02-04 12:43:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 260 proven. 7 refuted. 0 times theorem prover too weak. 237 trivial. 27 not checked. [2018-02-04 12:43:51,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:43:51,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 12:43:51,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:43:51,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:43:51,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=409, Unknown=5, NotChecked=172, Total=650 [2018-02-04 12:43:51,067 INFO L87 Difference]: Start difference. First operand 381 states and 491 transitions. Second operand 26 states. [2018-02-04 12:43:51,563 WARN L146 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 79 DAG size of output 51 [2018-02-04 12:44:07,443 WARN L146 SmtUtils]: Spent 15766ms on a formula simplification. DAG size of input: 78 DAG size of output 76 [2018-02-04 12:44:58,421 WARN L146 SmtUtils]: Spent 47944ms on a formula simplification. DAG size of input: 127 DAG size of output 54 [2018-02-04 12:45:03,028 WARN L146 SmtUtils]: Spent 2244ms on a formula simplification. DAG size of input: 116 DAG size of output 47 [2018-02-04 12:45:08,815 WARN L146 SmtUtils]: Spent 3724ms on a formula simplification. DAG size of input: 112 DAG size of output 45 [2018-02-04 12:45:14,698 WARN L146 SmtUtils]: Spent 3837ms on a formula simplification. DAG size of input: 112 DAG size of output 45 [2018-02-04 12:45:36,983 WARN L146 SmtUtils]: Spent 15659ms on a formula simplification. DAG size of input: 93 DAG size of output 61 [2018-02-04 12:45:47,556 WARN L146 SmtUtils]: Spent 8540ms on a formula simplification. DAG size of input: 69 DAG size of output 46 [2018-02-04 12:45:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:45:58,574 INFO L93 Difference]: Finished difference Result 634 states and 775 transitions. [2018-02-04 12:45:58,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:45:58,575 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 160 [2018-02-04 12:45:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:45:58,577 INFO L225 Difference]: With dead ends: 634 [2018-02-04 12:45:58,578 INFO L226 Difference]: Without dead ends: 634 [2018-02-04 12:45:58,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 128.3s TimeCoverageRelationStatistics Valid=163, Invalid=1253, Unknown=6, NotChecked=300, Total=1722 [2018-02-04 12:45:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-02-04 12:45:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 379. [2018-02-04 12:45:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-04 12:45:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 489 transitions. [2018-02-04 12:45:58,590 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 489 transitions. Word has length 160 [2018-02-04 12:45:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:45:58,590 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 489 transitions. [2018-02-04 12:45:58,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:45:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 489 transitions. [2018-02-04 12:45:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 12:45:58,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:45:58,592 INFO L351 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:45:58,592 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-02-04 12:45:58,593 INFO L82 PathProgramCache]: Analyzing trace with hash 80853138, now seen corresponding path program 1 times [2018-02-04 12:45:58,593 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:45:58,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:45:58,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:45:58,594 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:45:58,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:45:58,604 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:45:58,604 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:45:58,605 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:45:58,621 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:45:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:45:58,683 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:45:58,689 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-02-04 12:45:58,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:45:58,701 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-02-04 12:45:58,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:45:58,702 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-02-04 12:45:58,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:45:58,722 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-02-04 12:45:58,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:45:58,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:45:58,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-02-04 12:45:59,552 WARN L146 SmtUtils]: Spent 627ms on a formula simplification. DAG size of input: 116 DAG size of output 33 [2018-02-04 12:45:59,812 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse0 (mod (* v_prenex_62 v_prenex_60) 4294967296))) (and (<= .cse0 2147483647) (= (store |c_old(#length)| v_prenex_61 .cse0) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_61))))) (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))))) is different from true [2018-02-04 12:45:59,816 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-02-04 12:45:59,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:45:59,832 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-02-04 12:45:59,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:45:59,847 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-02-04 12:45:59,848 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:45:59,863 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-02-04 12:45:59,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:45:59,878 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-02-04 12:45:59,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-04 12:46:05,914 WARN L143 SmtUtils]: Spent 4014ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-04 12:46:06,093 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 (= 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))))) (.cse2 (exists ((v_prenex_67 Int) (v_prenex_69 Int) (v_prenex_70 Int)) (let ((.cse5 (mod (* v_prenex_67 v_prenex_70) 4294967296))) (and (= .cse5 (select |c_#length| v_prenex_69)) (<= .cse5 2147483647))))) (.cse3 (exists ((v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse4 (mod (* v_prenex_62 v_prenex_60) 4294967296))) (and (<= .cse4 2147483647) (= (store |c_old(#length)| v_prenex_61 .cse4) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_61)))))) (.cse1 (exists ((v_prenex_66 Int) (v_prenex_68 Int) (v_prenex_65 Int)) (and (< 2147483647 (mod (* v_prenex_68 v_prenex_65) 4294967296)) (= (+ (select |c_#length| v_prenex_66) 4294967296) (mod (* v_prenex_65 v_prenex_68) 4294967296)))))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse2 .cse3) (and .cse3 .cse1))) is different from true [2018-02-04 12:46:06,105 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_78 Int) (v_prenex_77 Int) (v_prenex_80 Int)) (and (< 2147483647 (mod (* v_prenex_78 v_prenex_80) 4294967296)) (= (+ (select |c_#length| v_prenex_77) 4294967296) (mod (* v_prenex_80 v_prenex_78) 4294967296)))) (exists ((v_prenex_79 Int) (v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse0 (mod (* v_prenex_79 v_prenex_82) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_81)) (<= .cse0 2147483647) (= (store |c_old(#length)| v_prenex_81 .cse0) |c_#length|))))) (and (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_66 Int) (v_prenex_68 Int) (v_prenex_65 Int)) (and (< 2147483647 (mod (* v_prenex_68 v_prenex_65) 4294967296)) (= (+ (select |c_#length| v_prenex_66) 4294967296) (mod (* v_prenex_65 v_prenex_68) 4294967296))))) (and (exists ((v_prenex_67 Int) (v_prenex_69 Int) (v_prenex_70 Int)) (let ((.cse1 (mod (* v_prenex_67 v_prenex_70) 4294967296))) (and (= .cse1 (select |c_#length| v_prenex_69)) (<= .cse1 2147483647)))) (exists ((v_prenex_73 Int) (v_prenex_72 Int) (v_prenex_71 Int)) (let ((.cse2 (mod (* v_prenex_73 v_prenex_71) 4294967296))) (and (< 2147483647 .cse2) (= (store |c_old(#length)| v_prenex_72 (+ .cse2 (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_72)))))) (and (exists ((v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse3 (mod (* v_prenex_62 v_prenex_60) 4294967296))) (and (<= .cse3 2147483647) (= (store |c_old(#length)| v_prenex_61 .cse3) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_61))))) (exists ((v_prenex_74 Int) (v_prenex_76 Int) (v_prenex_75 Int)) (let ((.cse4 (mod (* v_prenex_74 v_prenex_76) 4294967296))) (and (<= .cse4 2147483647) (= .cse4 (select |c_#length| v_prenex_75))))))) is different from true [2018-02-04 12:46:13,543 WARN L146 SmtUtils]: Spent 4081ms on a formula simplification. DAG size of input: 110 DAG size of output 35 [2018-02-04 12:46:13,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:13,558 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 55 treesize of output 58 [2018-02-04 12:46:13,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:46:14,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:14,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:14,334 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 46 treesize of output 40 [2018-02-04 12:46:14,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:46:14,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:14,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:14,947 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 44 treesize of output 38 [2018-02-04 12:46:14,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:46:15,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:15,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:15,464 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 46 treesize of output 61 [2018-02-04 12:46:15,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:46:16,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:16,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:16,042 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 47 treesize of output 41 [2018-02-04 12:46:16,042 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:46:16,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:16,491 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 40 treesize of output 49 [2018-02-04 12:46:16,491 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:46:16,828 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 38 treesize of output 37 [2018-02-04 12:46:16,828 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:46:17,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:17,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:46:17,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 45 treesize of output 39 [2018-02-04 12:46:17,124 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:46:17,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-02-04 12:46:17,458 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:213, output treesize:149 [2018-02-04 12:46:19,226 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse0 (mod (* v_prenex_62 v_prenex_60) 4294967296))) (and (= .cse0 (select |c_#length| v_prenex_61)) (<= .cse0 2147483647)))) (exists ((v_prenex_85 Int) (v_prenex_86 Int)) (let ((.cse1 (mod (* v_prenex_86 v_prenex_85) 4294967296))) (and (< 2147483647 .cse1) (= .cse1 (+ (select |c_#length| c_l4_insert_~item~0.base) 4294967296)))))) (and (exists ((v_prenex_92 Int) (v_prenex_91 Int) (v_prenex_94 Int)) (let ((.cse2 (mod (* v_prenex_91 v_prenex_94) 4294967296))) (and (= .cse2 (select |c_#length| v_prenex_92)) (<= .cse2 2147483647) (not (= c_l4_insert_~item~0.base v_prenex_92))))) (exists ((v_prenex_90 Int) (v_prenex_89 Int)) (let ((.cse3 (mod (* v_prenex_89 v_prenex_90) 4294967296))) (and (= (select |c_#length| c_l4_insert_~item~0.base) .cse3) (<= .cse3 3))))) (and (exists ((v_prenex_99 Int) (v_prenex_96 Int)) (let ((.cse4 (mod (* v_prenex_99 v_prenex_96) 4294967296))) (and (< 2147483647 .cse4) (= .cse4 (+ (select |c_#length| c_l4_insert_~item~0.base) 4294967296))))) (exists ((v_prenex_84 Int) (v_prenex_98 Int) (v_prenex_83 Int)) (and (< 2147483647 (mod (* v_prenex_84 v_prenex_83) 4294967296)) (= (mod (* v_prenex_83 v_prenex_84) 4294967296) (+ (select |c_#length| v_prenex_98) 4294967296)) (not (= c_l4_insert_~item~0.base v_prenex_98))))) (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_59 Int) (v_prenex_55 Int)) (let ((.cse5 (mod (* v_prenex_59 v_prenex_55) 4294967296))) (and (<= .cse5 3) (= .cse5 (select |c_#length| c_l4_insert_~item~0.base))))))) is different from true [2018-02-04 12:46:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 252 proven. 28 refuted. 2 times theorem prover too weak. 244 trivial. 5 not checked. [2018-02-04 12:46:19,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:46:19,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 12:46:19,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 12:46:19,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 12:46:19,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=303, Unknown=12, NotChecked=156, Total=552 [2018-02-04 12:46:19,321 INFO L87 Difference]: Start difference. First operand 379 states and 489 transitions. Second operand 24 states. [2018-02-04 12:46:21,434 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (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)))))) (and (or (exists ((v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse0 (mod (* v_prenex_62 v_prenex_60) 4294967296))) (and (<= .cse0 2147483647) (= (store |c_old(#length)| v_prenex_61 .cse0) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_61))))) .cse1) (let ((.cse3 (select |c_#length| |c_calloc_model_#t~malloc0.base|)) (.cse2 (= (select |c_#valid| |c_calloc_model_#t~malloc0.base|) 1)) (.cse4 (mod (* c_calloc_model_~nmemb c_calloc_model_~size) 4294967296))) (or (and .cse2 (= (+ .cse3 4294967296) .cse4) (< 2147483647 .cse4)) (and (= .cse3 .cse4) .cse2 (<= .cse4 2147483647)))) (or .cse1 (exists ((v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse5 (mod (* v_prenex_62 v_prenex_60) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_61) 0) (<= .cse5 2147483647) (= (store |c_old(#length)| v_prenex_61 .cse5) |c_#length|))))))) is different from true [2018-02-04 12:46:23,856 WARN L143 SmtUtils]: Spent 2032ms on a formula simplification that was a NOOP. DAG size: 40 [2018-02-04 12:46:39,541 WARN L146 SmtUtils]: Spent 15207ms on a formula simplification. DAG size of input: 97 DAG size of output 63 Received shutdown request... [2018-02-04 12:47:04,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:47:04,069 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 12:47:04,073 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 12:47:04,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:47:04 BoogieIcfgContainer [2018-02-04 12:47:04,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:47:04,074 INFO L168 Benchmark]: Toolchain (without parser) took 227791.43 ms. Allocated memory was 391.6 MB in the beginning and 666.9 MB in the end (delta: 275.3 MB). Free memory was 348.5 MB in the beginning and 472.6 MB in the end (delta: -124.0 MB). Peak memory consumption was 151.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:47:04,075 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 391.6 MB. Free memory is still 355.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:47:04,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.69 ms. Allocated memory is still 391.6 MB. Free memory was 348.5 MB in the beginning and 335.2 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:47:04,075 INFO L168 Benchmark]: Boogie Preprocessor took 35.29 ms. Allocated memory is still 391.6 MB. Free memory was 335.2 MB in the beginning and 333.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:47:04,075 INFO L168 Benchmark]: RCFGBuilder took 505.64 ms. Allocated memory is still 391.6 MB. Free memory was 333.9 MB in the beginning and 272.9 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. [2018-02-04 12:47:04,075 INFO L168 Benchmark]: TraceAbstraction took 227072.99 ms. Allocated memory was 391.6 MB in the beginning and 666.9 MB in the end (delta: 275.3 MB). Free memory was 272.9 MB in the beginning and 472.6 MB in the end (delta: -199.7 MB). Peak memory consumption was 75.5 MB. Max. memory is 5.3 GB. [2018-02-04 12:47:04,076 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.10 ms. Allocated memory is still 391.6 MB. Free memory is still 355.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 174.69 ms. Allocated memory is still 391.6 MB. Free memory was 348.5 MB in the beginning and 335.2 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.29 ms. Allocated memory is still 391.6 MB. Free memory was 335.2 MB in the beginning and 333.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 505.64 ms. Allocated memory is still 391.6 MB. Free memory was 333.9 MB in the beginning and 272.9 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 227072.99 ms. Allocated memory was 391.6 MB in the beginning and 666.9 MB in the end (delta: 275.3 MB). Free memory was 272.9 MB in the beginning and 472.6 MB in the end (delta: -199.7 MB). Peak memory consumption was 75.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 887). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (379states) and interpolant automaton (currently 13 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 159. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 270 locations, 83 error locations. TIMEOUT Result, 227.0s OverallTime, 10 OverallIterations, 18 TraceHistogramMax, 174.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2340 SDtfs, 1302 SDslu, 9814 SDs, 0 SdLazy, 6989 SolverSat, 242 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 28.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 989 GetRequests, 854 SyntacticMatches, 5 SemanticMatches, 129 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 163.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=8, 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 437 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 49.4s InterpolantComputationTime, 950 NumberOfCodeBlocks, 868 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 940 ConstructedInterpolants, 81 QuantifiedInterpolants, 1034976 SizeOfPredicates, 61 NumberOfNonLiveVariables, 4284 ConjunctsInSsa, 263 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 2214/2331 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-47-04-081.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-47-04-081.csv Completed graceful shutdown