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-0236_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:45:10,348 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:45:10,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:45:10,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:45:10,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:45:10,357 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:45:10,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:45:10,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:45:10,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:45:10,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:45:10,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:45:10,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:45:10,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:45:10,362 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:45:10,363 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:45:10,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:45:10,365 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:45:10,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:45:10,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:45:10,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:45:10,368 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:45:10,368 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:45:10,368 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:45:10,369 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:45:10,369 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:45:10,370 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:45:10,370 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:45:10,370 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:45:10,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:45:10,371 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:45:10,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:45:10,371 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-02 18:45:10,377 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:45:10,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:45:10,378 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:45:10,378 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:45:10,378 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:45:10,379 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:45:10,379 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:45:10,379 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:45:10,379 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:45:10,379 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:45:10,379 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:45:10,379 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:45:10,379 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:45:10,380 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:45:10,380 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:45:10,380 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:45:10,380 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:45:10,380 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:45:10,380 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:45:10,380 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:45:10,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:45:10,381 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:45:10,381 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:45:10,381 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:45:10,381 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:45:10,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:45:10,413 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:45:10,416 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:45:10,418 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:45:10,418 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:45:10,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0236_true-valid-memsafety.i [2018-02-02 18:45:10,546 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:45:10,547 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:45:10,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:45:10,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:45:10,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:45:10,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:45:10" (1/1) ... [2018-02-02 18:45:10,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49389d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:45:10, skipping insertion in model container [2018-02-02 18:45:10,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:45:10" (1/1) ... [2018-02-02 18:45:10,571 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:45:10,600 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:45:10,693 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:45:10,716 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:45:10,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:45:10 WrapperNode [2018-02-02 18:45:10,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:45:10,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:45:10,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:45:10,726 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:45:10,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:45:10" (1/1) ... [2018-02-02 18:45:10,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:45:10" (1/1) ... [2018-02-02 18:45:10,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:45:10" (1/1) ... [2018-02-02 18:45:10,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:45:10" (1/1) ... [2018-02-02 18:45:10,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:45:10" (1/1) ... [2018-02-02 18:45:10,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:45:10" (1/1) ... [2018-02-02 18:45:10,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:45:10" (1/1) ... [2018-02-02 18:45:10,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:45:10,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:45:10,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:45:10,768 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:45:10,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:45:10" (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-02 18:45:10,817 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:45:10,818 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:45:10,818 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-02 18:45:10,818 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-02 18:45:10,818 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-02 18:45:10,818 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-02 18:45:10,818 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-02 18:45:10,818 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-02 18:45:10,818 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-02 18:45:10,819 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-02 18:45:10,819 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-02 18:45:10,819 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-02 18:45:10,819 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-02 18:45:10,819 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-02 18:45:10,819 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:45:10,819 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:45:10,819 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:45:10,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:45:10,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:45:10,820 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:45:10,820 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 18:45:10,820 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 18:45:10,820 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:45:10,820 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:45:10,820 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 18:45:10,821 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 18:45:10,821 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-02 18:45:10,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:45:10,821 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-02 18:45:10,821 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-02 18:45:10,821 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-02 18:45:10,821 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-02 18:45:10,821 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-02 18:45:10,821 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-02 18:45:10,822 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-02 18:45:10,822 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-02 18:45:10,822 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-02 18:45:10,822 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-02 18:45:10,822 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-02 18:45:10,822 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:45:10,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:45:10,822 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:45:11,090 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 18:45:11,345 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:45:11,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:45:11 BoogieIcfgContainer [2018-02-02 18:45:11,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:45:11,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:45:11,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:45:11,350 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:45:11,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:45:10" (1/3) ... [2018-02-02 18:45:11,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6c45be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:45:11, skipping insertion in model container [2018-02-02 18:45:11,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:45:10" (2/3) ... [2018-02-02 18:45:11,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6c45be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:45:11, skipping insertion in model container [2018-02-02 18:45:11,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:45:11" (3/3) ... [2018-02-02 18:45:11,353 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0236_true-valid-memsafety.i [2018-02-02 18:45:11,360 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:45:11,367 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2018-02-02 18:45:11,397 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:45:11,397 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:45:11,397 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:45:11,398 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:45:11,398 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:45:11,398 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:45:11,398 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:45:11,398 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:45:11,399 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:45:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states. [2018-02-02 18:45:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:45:11,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:45:11,420 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:45:11,421 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:45:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash 12769440, now seen corresponding path program 1 times [2018-02-02 18:45:11,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:45:11,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:45:11,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:11,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:11,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:45:11,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:45:11,542 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-02 18:45:11,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:45:11,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:45:11,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:45:11,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:45:11,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:45:11,632 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 3 states. [2018-02-02 18:45:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:45:11,812 INFO L93 Difference]: Finished difference Result 282 states and 301 transitions. [2018-02-02 18:45:11,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:45:11,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:45:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:45:11,824 INFO L225 Difference]: With dead ends: 282 [2018-02-02 18:45:11,824 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 18:45:11,825 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-02 18:45:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 18:45:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 248. [2018-02-02 18:45:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 18:45:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 263 transitions. [2018-02-02 18:45:11,860 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 263 transitions. Word has length 4 [2018-02-02 18:45:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:45:11,860 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 263 transitions. [2018-02-02 18:45:11,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:45:11,860 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 263 transitions. [2018-02-02 18:45:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:45:11,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:45:11,860 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:45:11,860 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:45:11,860 INFO L82 PathProgramCache]: Analyzing trace with hash 12769441, now seen corresponding path program 1 times [2018-02-02 18:45:11,860 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:45:11,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:45:11,861 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:11,861 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:11,861 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:45:11,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:45:11,901 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-02 18:45:11,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:45:11,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:45:11,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:45:11,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:45:11,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:45:11,903 INFO L87 Difference]: Start difference. First operand 248 states and 263 transitions. Second operand 3 states. [2018-02-02 18:45:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:45:12,021 INFO L93 Difference]: Finished difference Result 255 states and 273 transitions. [2018-02-02 18:45:12,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:45:12,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:45:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:45:12,023 INFO L225 Difference]: With dead ends: 255 [2018-02-02 18:45:12,024 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 18:45:12,024 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-02 18:45:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 18:45:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 247. [2018-02-02 18:45:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 18:45:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 262 transitions. [2018-02-02 18:45:12,035 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 262 transitions. Word has length 4 [2018-02-02 18:45:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:45:12,036 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 262 transitions. [2018-02-02 18:45:12,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:45:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 262 transitions. [2018-02-02 18:45:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 18:45:12,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:45:12,036 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:45:12,037 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:45:12,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1129613849, now seen corresponding path program 1 times [2018-02-02 18:45:12,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:45:12,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:45:12,039 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:12,039 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:12,039 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:12,054 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:45:12,055 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:45:12,055 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-02 18:45:12,068 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:45:12,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:45:12,112 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-02 18:45:12,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:45:12,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:45:12,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 18:45:12,120 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-02 18:45:12,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:45:12,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:45:12,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:45:12,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:45:12,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:45:12,138 INFO L87 Difference]: Start difference. First operand 247 states and 262 transitions. Second operand 4 states. [2018-02-02 18:45:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:45:12,262 INFO L93 Difference]: Finished difference Result 246 states and 261 transitions. [2018-02-02 18:45:12,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:45:12,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 18:45:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:45:12,264 INFO L225 Difference]: With dead ends: 246 [2018-02-02 18:45:12,264 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 18:45:12,264 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-02 18:45:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 18:45:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-02-02 18:45:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-02 18:45:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 261 transitions. [2018-02-02 18:45:12,275 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 261 transitions. Word has length 17 [2018-02-02 18:45:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:45:12,275 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 261 transitions. [2018-02-02 18:45:12,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:45:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 261 transitions. [2018-02-02 18:45:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 18:45:12,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:45:12,276 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:45:12,276 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:45:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1129613850, now seen corresponding path program 1 times [2018-02-02 18:45:12,276 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:45:12,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:45:12,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:12,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:12,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:12,289 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:45:12,289 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:45:12,289 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-02 18:45:12,295 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:45:12,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:45:12,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-02 18:45:12,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:45:12,361 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-02 18:45:12,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:45:12,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:45:12,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-02 18:45:12,395 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-02 18:45:12,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:45:12,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:45:12,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:45:12,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:45:12,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:45:12,412 INFO L87 Difference]: Start difference. First operand 246 states and 261 transitions. Second operand 4 states. [2018-02-02 18:45:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:45:12,668 INFO L93 Difference]: Finished difference Result 245 states and 260 transitions. [2018-02-02 18:45:12,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:45:12,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 18:45:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:45:12,670 INFO L225 Difference]: With dead ends: 245 [2018-02-02 18:45:12,670 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 18:45:12,670 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-02 18:45:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 18:45:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-02-02 18:45:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-02 18:45:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions. [2018-02-02 18:45:12,678 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 17 [2018-02-02 18:45:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:45:12,678 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions. [2018-02-02 18:45:12,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:45:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions. [2018-02-02 18:45:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 18:45:12,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:45:12,682 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-02 18:45:12,682 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:45:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1939151952, now seen corresponding path program 1 times [2018-02-02 18:45:12,683 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:45:12,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:45:12,684 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:12,684 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:12,684 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:12,706 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:45:12,706 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:45:12,706 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-02 18:45:12,715 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:45:12,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:45:12,827 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-02 18:45:12,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:45:12,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:45:12,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 18:45:12,880 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-02 18:45:12,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:45:12,885 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-02 18:45:12,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:45:12,886 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-02 18:45:12,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 18:45:12,894 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-02 18:45:12,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:45:12,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:45:12,904 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-02 18:45:12,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:45:12,909 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-02 18:45:12,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-02 18:45:12,948 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-02 18:45:12,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:45:12,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 18:45:12,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:45:12,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:45:12,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-02 18:45:12,978 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 15 states. [2018-02-02 18:45:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:45:13,638 INFO L93 Difference]: Finished difference Result 270 states and 290 transitions. [2018-02-02 18:45:13,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:45:13,638 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-02 18:45:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:45:13,640 INFO L225 Difference]: With dead ends: 270 [2018-02-02 18:45:13,640 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 18:45:13,640 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-02 18:45:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 18:45:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 241. [2018-02-02 18:45:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-02 18:45:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 256 transitions. [2018-02-02 18:45:13,645 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 256 transitions. Word has length 142 [2018-02-02 18:45:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:45:13,646 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 256 transitions. [2018-02-02 18:45:13,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:45:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 256 transitions. [2018-02-02 18:45:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 18:45:13,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:45:13,648 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-02 18:45:13,648 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:45:13,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1939151953, now seen corresponding path program 1 times [2018-02-02 18:45:13,648 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:45:13,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:45:13,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:13,649 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:13,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:13,662 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:45:13,662 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:45:13,662 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-02 18:45:13,668 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:45:13,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:45:13,879 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-02 18:45:13,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:45:13,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:45:13,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:45:13,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:45:13,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:45:13,900 INFO L87 Difference]: Start difference. First operand 241 states and 256 transitions. Second operand 8 states. [2018-02-02 18:45:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:45:13,989 INFO L93 Difference]: Finished difference Result 251 states and 266 transitions. [2018-02-02 18:45:13,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:45:13,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-02 18:45:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:45:13,990 INFO L225 Difference]: With dead ends: 251 [2018-02-02 18:45:13,990 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 18:45:13,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:45:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 18:45:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-02-02 18:45:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 18:45:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-02-02 18:45:13,995 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 142 [2018-02-02 18:45:13,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:45:13,996 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-02-02 18:45:13,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:45:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-02-02 18:45:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 18:45:13,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:45:13,998 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-02 18:45:13,998 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:45:13,998 INFO L82 PathProgramCache]: Analyzing trace with hash -870251245, now seen corresponding path program 1 times [2018-02-02 18:45:13,998 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:45:13,998 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:45:13,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:13,999 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:13,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:14,010 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:45:14,010 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:45:14,010 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-02 18:45:14,018 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:45:14,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:45:14,328 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-02 18:45:14,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:45:14,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 18:45:14,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:45:14,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:45:14,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:45:14,347 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 9 states. [2018-02-02 18:45:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:45:14,474 INFO L93 Difference]: Finished difference Result 252 states and 267 transitions. [2018-02-02 18:45:14,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:45:14,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-02 18:45:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:45:14,476 INFO L225 Difference]: With dead ends: 252 [2018-02-02 18:45:14,476 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 18:45:14,477 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-02 18:45:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 18:45:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-02-02 18:45:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 18:45:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions. [2018-02-02 18:45:14,482 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 148 [2018-02-02 18:45:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:45:14,482 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions. [2018-02-02 18:45:14,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:45:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions. [2018-02-02 18:45:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 18:45:14,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:45:14,484 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-02 18:45:14,484 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:45:14,484 INFO L82 PathProgramCache]: Analyzing trace with hash 500054929, now seen corresponding path program 2 times [2018-02-02 18:45:14,485 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:45:14,485 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:45:14,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:14,486 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:45:14,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:14,497 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:45:14,497 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:45:14,497 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-02 18:45:14,510 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:45:15,602 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:45:15,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:45:15,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:45:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 99 proven. 56 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-02-02 18:45:15,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:45:15,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 18:45:15,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:45:15,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:45:15,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:45:15,750 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 10 states. [2018-02-02 18:45:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:45:15,866 INFO L93 Difference]: Finished difference Result 253 states and 268 transitions. [2018-02-02 18:45:15,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:45:15,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-02 18:45:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:45:15,870 INFO L225 Difference]: With dead ends: 253 [2018-02-02 18:45:15,870 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 18:45:15,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:45:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 18:45:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-02-02 18:45:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 18:45:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 259 transitions. [2018-02-02 18:45:15,875 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 259 transitions. Word has length 154 [2018-02-02 18:45:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:45:15,875 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 259 transitions. [2018-02-02 18:45:15,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:45:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 259 transitions. [2018-02-02 18:45:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-02 18:45:15,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:45:15,877 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-02 18:45:15,877 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:45:15,877 INFO L82 PathProgramCache]: Analyzing trace with hash -801201965, now seen corresponding path program 3 times [2018-02-02 18:45:15,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:45:15,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:45:15,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:15,879 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:45:15,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:15,888 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:45:15,888 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:45:15,888 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-02 18:45:15,901 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:45:16,051 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 18:45:16,051 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:45:16,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:45:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-02-02 18:45:16,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:45:16,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 18:45:16,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:45:16,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:45:16,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:45:16,166 INFO L87 Difference]: Start difference. First operand 244 states and 259 transitions. Second operand 11 states. [2018-02-02 18:45:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:45:16,264 INFO L93 Difference]: Finished difference Result 254 states and 269 transitions. [2018-02-02 18:45:16,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 18:45:16,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 160 [2018-02-02 18:45:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:45:16,265 INFO L225 Difference]: With dead ends: 254 [2018-02-02 18:45:16,266 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 18:45:16,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-02 18:45:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 18:45:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-02-02 18:45:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-02 18:45:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions. [2018-02-02 18:45:16,271 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 160 [2018-02-02 18:45:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:45:16,271 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions. [2018-02-02 18:45:16,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:45:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions. [2018-02-02 18:45:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-02-02 18:45:16,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:45:16,280 INFO L351 BasicCegarLoop]: trace histogram [24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:45:16,280 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_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:45:16,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2017850671, now seen corresponding path program 4 times [2018-02-02 18:45:16,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:45:16,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:45:16,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:16,281 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:45:16,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:16,293 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:45:16,294 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:45:16,294 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-02 18:45:16,305 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 18:45:19,505 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 18:45:19,505 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:45:19,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:45:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 448 proven. 24 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-02 18:45:19,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:45:19,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 18:45:19,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:45:19,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:45:19,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:45:19,627 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 12 states. [2018-02-02 18:45:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:45:19,738 INFO L93 Difference]: Finished difference Result 255 states and 270 transitions. [2018-02-02 18:45:19,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:45:19,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-02-02 18:45:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:45:19,739 INFO L225 Difference]: With dead ends: 255 [2018-02-02 18:45:19,739 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 18:45:19,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:45:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 18:45:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-02-02 18:45:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-02 18:45:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 261 transitions. [2018-02-02 18:45:19,744 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 261 transitions. Word has length 166 [2018-02-02 18:45:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:45:19,745 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 261 transitions. [2018-02-02 18:45:19,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:45:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 261 transitions. [2018-02-02 18:45:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 18:45:19,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:45:19,746 INFO L351 BasicCegarLoop]: trace histogram [30, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:45:19,747 INFO L371 AbstractCegarLoop]: === Iteration 11 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:45:19,747 INFO L82 PathProgramCache]: Analyzing trace with hash -291304301, now seen corresponding path program 5 times [2018-02-02 18:45:19,747 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:45:19,747 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:45:19,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:19,748 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:45:19,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:45:19,758 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:45:19,758 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:45:19,758 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:45:19,768 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 18:45:21,582 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-02 18:45:21,582 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:45:21,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:45:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 437 proven. 61 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-02-02 18:45:29,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:45:29,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 18:45:29,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 18:45:29,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 18:45:29,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=149, Unknown=7, NotChecked=0, Total=182 [2018-02-02 18:45:29,655 INFO L87 Difference]: Start difference. First operand 246 states and 261 transitions. Second operand 14 states. [2018-02-02 18:46:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:46:12,526 INFO L93 Difference]: Finished difference Result 260 states and 277 transitions. [2018-02-02 18:46:12,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:46:12,526 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 172 [2018-02-02 18:46:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:46:12,528 INFO L225 Difference]: With dead ends: 260 [2018-02-02 18:46:12,528 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 18:46:12,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=39, Invalid=224, Unknown=9, NotChecked=0, Total=272 [2018-02-02 18:46:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 18:46:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-02-02 18:46:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-02 18:46:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 275 transitions. [2018-02-02 18:46:12,533 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 275 transitions. Word has length 172 [2018-02-02 18:46:12,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:46:12,533 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 275 transitions. [2018-02-02 18:46:12,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 18:46:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 275 transitions. [2018-02-02 18:46:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-02 18:46:12,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:46:12,536 INFO L351 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:46:12,537 INFO L371 AbstractCegarLoop]: === Iteration 12 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr7RequiresViolation, l0_insertErr0RequiresViolation, l0_insertErr6RequiresViolation, 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_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, 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-02 18:46:12,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1936422383, now seen corresponding path program 6 times [2018-02-02 18:46:12,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:46:12,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:46:12,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:12,538 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:46:12,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:12,547 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:46:12,548 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:46:12,548 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:46:12,556 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 18:46:22,855 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-02 18:46:22,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:46:22,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:46:22,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-02-02 18:46:22,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:23,007 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-02 18:46:23,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:23,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:46:23,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:56 [2018-02-02 18:46:32,860 WARN L143 SmtUtils]: Spent 4008ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-02 18:46:33,447 WARN L143 SmtUtils]: Spent 576ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-02 18:46:34,309 WARN L143 SmtUtils]: Spent 809ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-02 18:46:44,592 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-02 18:46:44,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:44,611 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-02 18:46:44,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:44,625 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-02 18:46:44,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:44,642 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-02 18:46:44,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:44,656 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-02 18:46:44,656 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-02 18:46:46,684 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_prenex_13 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse7 (mod (* |c_calloc_model_#in~nmemb| v_prenex_13) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse7) |c_#length|) (<= .cse7 2147483647))))) (.cse0 (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int)) (let ((.cse6 (mod (* v_prenex_4 v_prenex_6) 4294967296))) (and (= (+ (select |c_#length| v_prenex_5) 4294967296) .cse6) (< 2147483647 .cse6))))) (.cse3 (exists ((v_prenex_18 Int) (calloc_model_~size Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse5) (= (store |c_old(#length)| v_prenex_18 (+ .cse5 (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_18)))))) (.cse2 (exists ((|v_calloc_model_#in~nmemb_BEFORE_CALL_6| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_2 Int) (v_calloc_model_~size_BEFORE_CALL_7 Int)) (let ((.cse4 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_6| v_calloc_model_~size_BEFORE_CALL_7) 4294967296))) (and (<= .cse4 2147483647) (= (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_2) .cse4)))))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse0) (and .cse3 .cse2))) is different from true [2018-02-02 18:46:48,725 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_18 Int) (calloc_model_~size Int)) (let ((.cse0 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= (store |c_old(#length)| v_prenex_18 (+ .cse0 (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_18))))) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int)) (let ((.cse1 (mod (* v_prenex_22 v_prenex_21) 4294967296))) (and (= (+ (select |c_#length| v_prenex_23) 4294967296) .cse1) (< 2147483647 .cse1))))) (and (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int)) (let ((.cse2 (mod (* v_prenex_4 v_prenex_6) 4294967296))) (and (= (+ (select |c_#length| v_prenex_5) 4294967296) .cse2) (< 2147483647 .cse2)))) (exists ((v_prenex_13 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse3 (mod (* |c_calloc_model_#in~nmemb| v_prenex_13) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse3) |c_#length|) (<= .cse3 2147483647))))) (and (exists ((v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_20 .cse4)) (<= .cse4 2147483647) (= 0 (select |c_old(#valid)| v_prenex_20))))) (exists ((|v_calloc_model_#in~nmemb_BEFORE_CALL_6| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_2 Int) (v_calloc_model_~size_BEFORE_CALL_7 Int)) (let ((.cse5 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_6| v_calloc_model_~size_BEFORE_CALL_7) 4294967296))) (and (<= .cse5 2147483647) (= (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_2) .cse5))))) (and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int)) (let ((.cse6 (mod (* v_prenex_28 v_prenex_27) 4294967296))) (and (<= .cse6 2147483647) (= (select |c_#length| v_prenex_26) .cse6)))) (exists ((v_prenex_25 Int) (v_prenex_24 Int)) (let ((.cse7 (mod (* |c_calloc_model_#in~nmemb| v_prenex_25) 4294967296))) (and (< 2147483647 .cse7) (= 0 (select |c_old(#valid)| v_prenex_24)) (= |c_#length| (store |c_old(#length)| v_prenex_24 (+ .cse7 (- 4294967296))))))))) is different from true [2018-02-02 18:46:50,437 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse0 (mod v_prenex_19 4294967296))) (and (= (store |c_old(#length)| v_prenex_20 .cse0) |c_#length|) (<= .cse0 2147483647) (= 0 (select |c_old(#valid)| v_prenex_20))))) (exists ((|v_calloc_model_#in~nmemb_BEFORE_CALL_6| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_2 Int) (v_calloc_model_~size_BEFORE_CALL_7 Int)) (let ((.cse1 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_6| v_calloc_model_~size_BEFORE_CALL_7) 4294967296))) (and (<= .cse1 2147483647) (= (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_2) .cse1))))) (and (exists ((v_prenex_18 Int) (calloc_model_~size Int)) (let ((.cse2 (mod calloc_model_~size 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_18 (+ .cse2 (- 4294967296)))) (< 2147483647 .cse2) (= 0 (select |c_old(#valid)| v_prenex_18))))) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int)) (let ((.cse3 (mod (* v_prenex_22 v_prenex_21) 4294967296))) (and (= (+ (select |c_#length| v_prenex_23) 4294967296) .cse3) (< 2147483647 .cse3))))) (and (exists ((v_prenex_13 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse4 (mod v_prenex_13 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse4 2147483647) (= |c_#length| (store |c_old(#length)| calloc_model_~ptr~0.base .cse4))))) (exists ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int)) (let ((.cse5 (mod (* v_prenex_4 v_prenex_6) 4294967296))) (and (= (+ (select |c_#length| v_prenex_5) 4294967296) .cse5) (< 2147483647 .cse5))))) (and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int)) (let ((.cse6 (mod (* v_prenex_28 v_prenex_27) 4294967296))) (and (<= .cse6 2147483647) (= (select |c_#length| v_prenex_26) .cse6)))) (exists ((v_prenex_25 Int) (v_prenex_24 Int)) (let ((.cse7 (mod v_prenex_25 4294967296))) (and (< 2147483647 .cse7) (= 0 (select |c_old(#valid)| v_prenex_24)) (= |c_#length| (store |c_old(#length)| v_prenex_24 (+ .cse7 (- 4294967296))))))))) is different from true [2018-02-02 18:46:50,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:50,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:50,460 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 50 treesize of output 63 [2018-02-02 18:46:50,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:50,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:50,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:50,658 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-02 18:46:50,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:50,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:50,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:50,859 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 52 treesize of output 65 [2018-02-02 18:46:50,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:50,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:50,988 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-02 18:46:50,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:51,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:51,134 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 48 treesize of output 51 [2018-02-02 18:46:51,134 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:51,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:51,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:51,268 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-02 18:46:51,268 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:51,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:51,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:51,393 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-02 18:46:51,393 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:51,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:51,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:51,522 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 51 treesize of output 45 [2018-02-02 18:46:51,522 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:51,609 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-02 18:46:51,609 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:201, output treesize:165 Received shutdown request... [2018-02-02 18:46:59,917 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 18:46:59,917 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:46:59,921 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:46:59,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:46:59 BoogieIcfgContainer [2018-02-02 18:46:59,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:46:59,922 INFO L168 Benchmark]: Toolchain (without parser) took 109375.30 ms. Allocated memory was 403.7 MB in the beginning and 697.8 MB in the end (delta: 294.1 MB). Free memory was 360.4 MB in the beginning and 624.7 MB in the end (delta: -264.3 MB). Peak memory consumption was 29.8 MB. Max. memory is 5.3 GB. [2018-02-02 18:46:59,922 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:46:59,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.71 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 347.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:46:59,923 INFO L168 Benchmark]: Boogie Preprocessor took 41.69 ms. Allocated memory is still 403.7 MB. Free memory was 347.1 MB in the beginning and 345.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:46:59,923 INFO L168 Benchmark]: RCFGBuilder took 578.07 ms. Allocated memory is still 403.7 MB. Free memory was 345.7 MB in the beginning and 288.7 MB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 5.3 GB. [2018-02-02 18:46:59,923 INFO L168 Benchmark]: TraceAbstraction took 108574.50 ms. Allocated memory was 403.7 MB in the beginning and 697.8 MB in the end (delta: 294.1 MB). Free memory was 287.4 MB in the beginning and 624.7 MB in the end (delta: -337.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:46:59,924 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 177.71 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 347.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.69 ms. Allocated memory is still 403.7 MB. Free memory was 347.1 MB in the beginning and 345.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 578.07 ms. Allocated memory is still 403.7 MB. Free memory was 345.7 MB in the beginning and 288.7 MB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 108574.50 ms. Allocated memory was 403.7 MB in the beginning and 697.8 MB in the end (delta: 294.1 MB). Free memory was 287.4 MB in the beginning and 624.7 MB in the end (delta: -337.3 MB). There was no memory consumed. 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 839). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 840). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 840). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 841). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 841). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 823). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 823). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 823). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 823). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 824). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 824). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 830). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 831). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 831). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 830). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 876]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 876). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 814). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 814). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 871). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 869). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 869). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 871). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 784). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 784). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 878). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 878). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 861). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 861). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 850). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 851). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 851). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 850). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 95. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 253 locations, 85 error locations. TIMEOUT Result, 108.5s OverallTime, 12 OverallIterations, 36 TraceHistogramMax, 44.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2630 SDtfs, 508 SDslu, 14327 SDs, 0 SdLazy, 2713 SolverSat, 103 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 40.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1142 GetRequests, 1040 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1126 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1115 ConstructedInterpolants, 27 QuantifiedInterpolants, 342376 SizeOfPredicates, 47 NumberOfNonLiveVariables, 4624 ConjunctsInSsa, 231 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 3218/3375 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-0236_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-46-59-929.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0236_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-46-59-929.csv Completed graceful shutdown