java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:33:35,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:33:35,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:33:35,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:33:35,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:33:35,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:33:35,514 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:33:35,515 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:33:35,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:33:35,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:33:35,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:33:35,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:33:35,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:33:35,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:33:35,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:33:35,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:33:35,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:33:35,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:33:35,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:33:35,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:33:35,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:33:35,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:33:35,525 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:33:35,526 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:33:35,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:33:35,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:33:35,527 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:33:35,527 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:33:35,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:33:35,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:33:35,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:33:35,528 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:33:35,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:33:35,538 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:33:35,539 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:33:35,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:33:35,540 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:33:35,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:33:35,540 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:33:35,540 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:33:35,540 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:33:35,540 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:33:35,541 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:33:35,541 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:33:35,541 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:33:35,541 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:33:35,541 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:33:35,541 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:33:35,542 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:33:35,542 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:33:35,542 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:33:35,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:33:35,542 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:33:35,542 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:33:35,542 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:33:35,543 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:33:35,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:33:35,581 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:33:35,584 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:33:35,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:33:35,586 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:33:35,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0235_false-valid-memtrack.i [2018-02-04 12:33:35,741 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:33:35,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:33:35,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:33:35,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:33:35,749 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:33:35,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:33:35" (1/1) ... [2018-02-04 12:33:35,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ec44b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:33:35, skipping insertion in model container [2018-02-04 12:33:35,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:33:35" (1/1) ... [2018-02-04 12:33:35,769 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:33:35,802 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:33:35,892 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:33:35,910 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:33:35,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:33:35 WrapperNode [2018-02-04 12:33:35,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:33:35,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:33:35,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:33:35,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:33:35,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:33:35" (1/1) ... [2018-02-04 12:33:35,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:33:35" (1/1) ... [2018-02-04 12:33:35,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:33:35" (1/1) ... [2018-02-04 12:33:35,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:33:35" (1/1) ... [2018-02-04 12:33:35,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:33:35" (1/1) ... [2018-02-04 12:33:35,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:33:35" (1/1) ... [2018-02-04 12:33:35,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:33:35" (1/1) ... [2018-02-04 12:33:35,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:33:35,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:33:35,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:33:35,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:33:35,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:33:35" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:33:35,987 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:33:35,987 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:33:35,987 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-04 12:33:35,987 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-04 12:33:35,987 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-04 12:33:35,987 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-04 12:33:35,987 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-04 12:33:35,987 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-04 12:33:35,987 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-04 12:33:35,988 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-04 12:33:35,988 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-04 12:33:35,988 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-04 12:33:35,988 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-04 12:33:35,988 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-04 12:33:35,988 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:33:35,988 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:33:35,988 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:33:35,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:33:35,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:33:35,988 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:33:35,988 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 12:33:35,988 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 12:33:35,988 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-04 12:33:35,989 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-04 12:33:35,990 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-04 12:33:35,990 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-04 12:33:35,990 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-04 12:33:35,990 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-04 12:33:35,990 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:33:35,990 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:33:35,990 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:33:36,274 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 12:33:36,440 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:33:36,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:33:36 BoogieIcfgContainer [2018-02-04 12:33:36,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:33:36,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:33:36,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:33:36,442 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:33:36,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:33:35" (1/3) ... [2018-02-04 12:33:36,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71552ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:33:36, skipping insertion in model container [2018-02-04 12:33:36,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:33:35" (2/3) ... [2018-02-04 12:33:36,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71552ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:33:36, skipping insertion in model container [2018-02-04 12:33:36,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:33:36" (3/3) ... [2018-02-04 12:33:36,444 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_false-valid-memtrack.i [2018-02-04 12:33:36,449 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:33:36,463 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 81 error locations. [2018-02-04 12:33:36,492 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:33:36,492 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:33:36,493 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:33:36,493 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:33:36,493 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:33:36,493 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:33:36,493 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:33:36,493 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:33:36,493 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:33:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states. [2018-02-04 12:33:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:33:36,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:33:36,513 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:33:36,514 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:33:36,518 INFO L82 PathProgramCache]: Analyzing trace with hash 14892544, now seen corresponding path program 1 times [2018-02-04 12:33:36,519 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:33:36,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:33:36,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:36,548 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:36,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:33:36,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:33:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:33:36,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:33:36,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:33:36,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:33:36,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:33:36,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:33:36,631 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 3 states. [2018-02-04 12:33:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:33:36,884 INFO L93 Difference]: Finished difference Result 378 states and 430 transitions. [2018-02-04 12:33:36,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:33:36,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:33:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:33:36,897 INFO L225 Difference]: With dead ends: 378 [2018-02-04 12:33:36,898 INFO L226 Difference]: Without dead ends: 375 [2018-02-04 12:33:36,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:33:36,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-02-04 12:33:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 331. [2018-02-04 12:33:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-04 12:33:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 406 transitions. [2018-02-04 12:33:36,951 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 406 transitions. Word has length 4 [2018-02-04 12:33:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:33:36,951 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 406 transitions. [2018-02-04 12:33:36,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:33:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 406 transitions. [2018-02-04 12:33:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:33:36,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:33:36,952 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:33:36,952 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:33:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash 14892545, now seen corresponding path program 1 times [2018-02-04 12:33:36,952 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:33:36,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:33:36,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:36,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:36,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:33:36,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:33:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:33:37,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:33:37,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:33:37,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:33:37,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:33:37,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:33:37,004 INFO L87 Difference]: Start difference. First operand 331 states and 406 transitions. Second operand 3 states. [2018-02-04 12:33:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:33:37,097 INFO L93 Difference]: Finished difference Result 338 states and 416 transitions. [2018-02-04 12:33:37,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:33:37,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:33:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:33:37,099 INFO L225 Difference]: With dead ends: 338 [2018-02-04 12:33:37,099 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 12:33:37,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:33:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 12:33:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 330. [2018-02-04 12:33:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-04 12:33:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 405 transitions. [2018-02-04 12:33:37,117 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 405 transitions. Word has length 4 [2018-02-04 12:33:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:33:37,118 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 405 transitions. [2018-02-04 12:33:37,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:33:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 405 transitions. [2018-02-04 12:33:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:33:37,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:33:37,118 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:33:37,119 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:33:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash -948681041, now seen corresponding path program 1 times [2018-02-04 12:33:37,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:33:37,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:33:37,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:37,120 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:37,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:37,134 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:33:37,134 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:33:37,134 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:33:37,141 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:33:37,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:33:37,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:33:37,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:33:37,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:33:37,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:33:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:33:37,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:33:37,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:33:37,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:33:37,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:33:37,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:33:37,246 INFO L87 Difference]: Start difference. First operand 330 states and 405 transitions. Second operand 4 states. [2018-02-04 12:33:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:33:37,406 INFO L93 Difference]: Finished difference Result 329 states and 404 transitions. [2018-02-04 12:33:37,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:33:37,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 12:33:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:33:37,407 INFO L225 Difference]: With dead ends: 329 [2018-02-04 12:33:37,407 INFO L226 Difference]: Without dead ends: 329 [2018-02-04 12:33:37,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:33:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-04 12:33:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-02-04 12:33:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-02-04 12:33:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 404 transitions. [2018-02-04 12:33:37,421 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 404 transitions. Word has length 17 [2018-02-04 12:33:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:33:37,421 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 404 transitions. [2018-02-04 12:33:37,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:33:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 404 transitions. [2018-02-04 12:33:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:33:37,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:33:37,422 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:33:37,422 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:33:37,422 INFO L82 PathProgramCache]: Analyzing trace with hash -948681040, now seen corresponding path program 1 times [2018-02-04 12:33:37,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:33:37,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:33:37,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:37,423 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:37,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:37,434 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:33:37,434 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:33:37,435 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:33:37,439 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:33:37,454 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:33:37,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-02-04 12:33:37,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:33:37,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-04 12:33:37,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:33:37,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:33:37,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-04 12:33:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:33:37,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:33:37,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:33:37,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:33:37,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:33:37,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:33:37,564 INFO L87 Difference]: Start difference. First operand 329 states and 404 transitions. Second operand 4 states. [2018-02-04 12:33:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:33:37,726 INFO L93 Difference]: Finished difference Result 328 states and 403 transitions. [2018-02-04 12:33:37,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:33:37,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 12:33:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:33:37,728 INFO L225 Difference]: With dead ends: 328 [2018-02-04 12:33:37,728 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 12:33:37,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:33:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 12:33:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-02-04 12:33:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 12:33:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 403 transitions. [2018-02-04 12:33:37,738 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 403 transitions. Word has length 17 [2018-02-04 12:33:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:33:37,738 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 403 transitions. [2018-02-04 12:33:37,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:33:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 403 transitions. [2018-02-04 12:33:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 12:33:37,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:33:37,741 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:33:37,741 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:33:37,741 INFO L82 PathProgramCache]: Analyzing trace with hash -21730712, now seen corresponding path program 1 times [2018-02-04 12:33:37,741 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:33:37,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:33:37,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:37,742 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:37,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:37,760 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:33:37,760 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:33:37,760 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:33:37,778 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:33:37,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:33:37,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:33:37,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:33:37,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:33:37,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:33:37,916 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1)))) is different from true [2018-02-04 12:33:37,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:33:37,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 12:33:37,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:33:37,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:33:37,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 12:33:37,929 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~0.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~0.base_BEFORE_CALL_1))) (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1))))) is different from true [2018-02-04 12:33:37,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:33:37,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:33:37,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:33:37,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:33:37,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:33:37,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-04 12:33:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-02-04 12:33:38,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:33:38,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 12:33:38,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:33:38,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:33:38,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-04 12:33:38,017 INFO L87 Difference]: Start difference. First operand 328 states and 403 transitions. Second operand 15 states. [2018-02-04 12:33:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:33:38,887 INFO L93 Difference]: Finished difference Result 496 states and 607 transitions. [2018-02-04 12:33:38,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:33:38,887 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-04 12:33:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:33:38,890 INFO L225 Difference]: With dead ends: 496 [2018-02-04 12:33:38,890 INFO L226 Difference]: Without dead ends: 496 [2018-02-04 12:33:38,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-02-04 12:33:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-02-04 12:33:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 371. [2018-02-04 12:33:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-02-04 12:33:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 478 transitions. [2018-02-04 12:33:38,908 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 478 transitions. Word has length 142 [2018-02-04 12:33:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:33:38,909 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 478 transitions. [2018-02-04 12:33:38,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:33:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 478 transitions. [2018-02-04 12:33:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 12:33:38,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:33:38,913 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:33:38,915 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:33:38,915 INFO L82 PathProgramCache]: Analyzing trace with hash -21730711, now seen corresponding path program 1 times [2018-02-04 12:33:38,915 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:33:38,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:33:38,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:38,916 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:38,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:38,928 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:33:38,928 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:33:38,929 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:33:38,936 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:33:39,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:33:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 12:33:39,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:33:39,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:33:39,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:33:39,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:33:39,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:33:39,154 INFO L87 Difference]: Start difference. First operand 371 states and 478 transitions. Second operand 8 states. [2018-02-04 12:33:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:33:39,282 INFO L93 Difference]: Finished difference Result 381 states and 488 transitions. [2018-02-04 12:33:39,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:33:39,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-04 12:33:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:33:39,286 INFO L225 Difference]: With dead ends: 381 [2018-02-04 12:33:39,287 INFO L226 Difference]: Without dead ends: 372 [2018-02-04 12:33:39,287 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-04 12:33:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-02-04 12:33:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2018-02-04 12:33:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-02-04 12:33:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 479 transitions. [2018-02-04 12:33:39,296 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 479 transitions. Word has length 142 [2018-02-04 12:33:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:33:39,297 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 479 transitions. [2018-02-04 12:33:39,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:33:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 479 transitions. [2018-02-04 12:33:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-04 12:33:39,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:33:39,298 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:33:39,298 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:33:39,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2121921167, now seen corresponding path program 1 times [2018-02-04 12:33:39,299 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:33:39,299 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:33:39,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:39,299 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:39,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:39,310 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:33:39,310 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:33:39,310 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:33:39,320 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:33:39,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:33:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-04 12:33:39,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:33:39,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 12:33:39,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:33:39,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:33:39,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:33:39,628 INFO L87 Difference]: Start difference. First operand 372 states and 479 transitions. Second operand 9 states. [2018-02-04 12:33:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:33:39,734 INFO L93 Difference]: Finished difference Result 382 states and 489 transitions. [2018-02-04 12:33:39,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:33:39,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-04 12:33:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:33:39,740 INFO L225 Difference]: With dead ends: 382 [2018-02-04 12:33:39,740 INFO L226 Difference]: Without dead ends: 373 [2018-02-04 12:33:39,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:33:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-04 12:33:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-02-04 12:33:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-04 12:33:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-02-04 12:33:39,748 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 148 [2018-02-04 12:33:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:33:39,748 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-02-04 12:33:39,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:33:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-02-04 12:33:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 12:33:39,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:33:39,750 INFO L351 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:33:39,750 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:33:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1794518359, now seen corresponding path program 2 times [2018-02-04 12:33:39,751 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:33:39,751 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:33:39,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:39,751 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:33:39,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:33:39,761 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:33:39,762 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:33:39,762 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:33:39,769 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:33:41,306 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:33:41,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:33:41,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:33:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 130 proven. 3 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-02-04 12:33:54,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:33:54,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 12:33:54,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:33:54,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:33:54,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=65, Unknown=8, NotChecked=0, Total=90 [2018-02-04 12:33:54,290 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 10 states. [2018-02-04 12:34:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:44,939 INFO L93 Difference]: Finished difference Result 389 states and 499 transitions. [2018-02-04 12:34:44,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:34:44,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-04 12:34:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:44,941 INFO L225 Difference]: With dead ends: 389 [2018-02-04 12:34:44,941 INFO L226 Difference]: Without dead ends: 389 [2018-02-04 12:34:44,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=29, Invalid=115, Unknown=12, NotChecked=0, Total=156 [2018-02-04 12:34:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-04 12:34:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-02-04 12:34:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-02-04 12:34:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 499 transitions. [2018-02-04 12:34:44,950 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 499 transitions. Word has length 154 [2018-02-04 12:34:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:44,950 INFO L432 AbstractCegarLoop]: Abstraction has 389 states and 499 transitions. [2018-02-04 12:34:44,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:34:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 499 transitions. [2018-02-04 12:34:44,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-04 12:34:44,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:44,953 INFO L351 BasicCegarLoop]: trace histogram [17, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:44,953 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:34:44,953 INFO L82 PathProgramCache]: Analyzing trace with hash -460336454, now seen corresponding path program 3 times [2018-02-04 12:34:44,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:44,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:44,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:44,954 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:34:44,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:44,964 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:34:44,964 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:34:44,965 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:34:44,975 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:34:45,038 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 12:34:45,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:34:45,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-02-04 12:34:45,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:34:45,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 12:34:45,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:34:45,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:34:45,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:34:45,158 INFO L87 Difference]: Start difference. First operand 389 states and 499 transitions. Second operand 10 states. [2018-02-04 12:34:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:45,279 INFO L93 Difference]: Finished difference Result 396 states and 505 transitions. [2018-02-04 12:34:45,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:34:45,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2018-02-04 12:34:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:45,281 INFO L225 Difference]: With dead ends: 396 [2018-02-04 12:34:45,282 INFO L226 Difference]: Without dead ends: 387 [2018-02-04 12:34:45,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:34:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-04 12:34:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-02-04 12:34:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-04 12:34:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 494 transitions. [2018-02-04 12:34:45,291 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 494 transitions. Word has length 159 [2018-02-04 12:34:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:45,292 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 494 transitions. [2018-02-04 12:34:45,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:34:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 494 transitions. [2018-02-04 12:34:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-04 12:34:45,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:45,294 INFO L351 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:34:45,294 INFO L371 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:34:45,294 INFO L82 PathProgramCache]: Analyzing trace with hash -209330255, now seen corresponding path program 4 times [2018-02-04 12:34:45,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:45,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:45,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:45,295 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:34:45,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:45,306 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:34:45,306 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:34:45,306 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-04 12:34:45,317 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:34:50,337 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:34:50,337 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:34:50,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 341 proven. 40 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-02-04 12:34:50,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:34:50,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 12:34:50,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:34:50,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:34:50,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:34:50,454 INFO L87 Difference]: Start difference. First operand 387 states and 494 transitions. Second operand 13 states. [2018-02-04 12:34:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:50,599 INFO L93 Difference]: Finished difference Result 404 states and 511 transitions. [2018-02-04 12:34:50,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:34:50,600 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 160 [2018-02-04 12:34:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:50,601 INFO L225 Difference]: With dead ends: 404 [2018-02-04 12:34:50,601 INFO L226 Difference]: Without dead ends: 388 [2018-02-04 12:34:50,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:34:50,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-04 12:34:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-02-04 12:34:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-04 12:34:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 495 transitions. [2018-02-04 12:34:50,609 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 495 transitions. Word has length 160 [2018-02-04 12:34:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:50,609 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 495 transitions. [2018-02-04 12:34:50,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:34:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 495 transitions. [2018-02-04 12:34:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-02-04 12:34:50,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:50,611 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-04 12:34:50,611 INFO L371 AbstractCegarLoop]: === Iteration 11 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:34:50,611 INFO L82 PathProgramCache]: Analyzing trace with hash -213181719, now seen corresponding path program 5 times [2018-02-04 12:34:50,611 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:50,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:50,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:50,612 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:34:50,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:50,621 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:34:50,621 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:34:50,621 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-04 12:34:50,635 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:34:51,000 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-02-04 12:34:51,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:34:51,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 374 proven. 10 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-02-04 12:34:51,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:34:51,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 12:34:51,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:34:51,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:34:51,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:34:51,132 INFO L87 Difference]: Start difference. First operand 388 states and 495 transitions. Second operand 12 states. [2018-02-04 12:34:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:34:51,251 INFO L93 Difference]: Finished difference Result 405 states and 512 transitions. [2018-02-04 12:34:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:34:51,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-02-04 12:34:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:34:51,253 INFO L225 Difference]: With dead ends: 405 [2018-02-04 12:34:51,253 INFO L226 Difference]: Without dead ends: 389 [2018-02-04 12:34:51,253 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-04 12:34:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-04 12:34:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-02-04 12:34:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-02-04 12:34:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 496 transitions. [2018-02-04 12:34:51,264 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 496 transitions. Word has length 166 [2018-02-04 12:34:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:34:51,264 INFO L432 AbstractCegarLoop]: Abstraction has 389 states and 496 transitions. [2018-02-04 12:34:51,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:34:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 496 transitions. [2018-02-04 12:34:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 12:34:51,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:34:51,266 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-04 12:34:51,266 INFO L371 AbstractCegarLoop]: === Iteration 12 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-04 12:34:51,267 INFO L82 PathProgramCache]: Analyzing trace with hash -607972879, now seen corresponding path program 6 times [2018-02-04 12:34:51,267 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:34:51,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:34:51,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:51,268 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:34:51,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:34:51,278 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 12:34:51,278 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-04 12:34:51,280 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-04 12:34:51,292 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:34:52,037 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-04 12:34:52,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:34:52,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:34:52,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-04 12:34:52,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:52,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-02-04 12:34:52,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:52,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-02-04 12:34:52,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:52,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-02-04 12:34:52,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:52,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:34:52,483 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-04 12:34:52,646 WARN L143 SmtUtils]: Spent 155ms on a formula simplification that was a NOOP. DAG size: 28 [2018-02-04 12:34:56,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 12:34:56,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:56,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-02-04 12:34:56,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:56,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 12:34:56,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:56,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-02-04 12:34:56,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:56,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 12:34:56,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-04 12:34:58,459 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_7| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse0 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_7| calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296) .cse0) (< 2147483647 .cse0)))) (exists ((v_prenex_16 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse1 (mod (* v_prenex_14 v_prenex_13) 4294967296))) (and (= (select |c_#length| v_prenex_16) .cse1) (<= .cse1 2147483647))))) is different from true [2018-02-04 12:34:58,477 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_7| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse7 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_7| calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296) .cse7) (< 2147483647 .cse7))))) (.cse2 (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (< 2147483647 .cse6) (= 0 (select |c_old(#valid)| v_prenex_18)) (= |c_#length| (store |c_old(#length)| v_prenex_18 (+ .cse6 (- 4294967296)))))))) (.cse3 (exists ((v_prenex_16 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse5 (mod (* v_prenex_14 v_prenex_13) 4294967296))) (and (= (select |c_#length| v_prenex_16) .cse5) (<= .cse5 2147483647))))) (.cse1 (exists ((v_prenex_20 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_20) 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse4) |c_#length|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse4 2147483647)))))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) is different from true [2018-02-04 12:34:58,490 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_7| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse0 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_7| calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296) .cse0) (< 2147483647 .cse0)))) (exists ((v_prenex_20 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse1 (mod (* |c_calloc_model_#in~nmemb| v_prenex_20) 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse1) |c_#length|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse1 2147483647))))) (and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int)) (let ((.cse2 (mod (* v_prenex_27 v_prenex_28) 4294967296))) (and (= (select |c_#length| v_prenex_26) .cse2) (<= .cse2 2147483647)))) (exists ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse3 (mod (* |c_calloc_model_#in~nmemb| v_prenex_29) 4294967296))) (and (<= .cse3 2147483647) (= (store |c_old(#length)| v_prenex_30 .cse3) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_30)))))) (and (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (< 2147483647 .cse4) (= 0 (select |c_old(#valid)| v_prenex_18)) (= |c_#length| (store |c_old(#length)| v_prenex_18 (+ .cse4 (- 4294967296))))))) (exists ((v_prenex_16 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse5 (mod (* v_prenex_14 v_prenex_13) 4294967296))) (and (= (select |c_#length| v_prenex_16) .cse5) (<= .cse5 2147483647))))) (and (exists ((v_prenex_25 Int) (v_prenex_21 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_25) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_21)) (< 2147483647 .cse6) (= (store |c_old(#length)| v_prenex_21 (+ .cse6 (- 4294967296))) |c_#length|)))) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int)) (let ((.cse7 (mod (* v_prenex_24 v_prenex_22) 4294967296))) (and (= (+ (select |c_#length| v_prenex_23) 4294967296) .cse7) (< 2147483647 .cse7)))))) is different from true [2018-02-04 12:34:58,503 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_7| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse0 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_7| calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296) .cse0) (< 2147483647 .cse0)))) (exists ((calloc_model_~ptr~0.base Int) (v_prenex_20 Int)) (let ((.cse1 (mod v_prenex_20 4294967296))) (and (<= .cse1 2147483647) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse1) |c_#length|))))) (and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int)) (let ((.cse2 (mod (* v_prenex_24 v_prenex_22) 4294967296))) (and (= (+ (select |c_#length| v_prenex_23) 4294967296) .cse2) (< 2147483647 .cse2)))) (exists ((v_prenex_25 Int) (v_prenex_21 Int)) (let ((.cse3 (mod v_prenex_25 4294967296))) (and (< 2147483647 .cse3) (= (select |c_old(#valid)| v_prenex_21) 0) (= |c_#length| (store |c_old(#length)| v_prenex_21 (+ .cse3 (- 4294967296)))))))) (and (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (let ((.cse4 (mod v_prenex_19 4294967296))) (and (< 2147483647 .cse4) (= 0 (select |c_old(#valid)| v_prenex_18)) (= |c_#length| (store |c_old(#length)| v_prenex_18 (+ .cse4 (- 4294967296))))))) (exists ((v_prenex_16 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse5 (mod (* v_prenex_14 v_prenex_13) 4294967296))) (and (= (select |c_#length| v_prenex_16) .cse5) (<= .cse5 2147483647))))) (and (exists ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse6 (mod v_prenex_29 4294967296))) (and (<= .cse6 2147483647) (= |c_#length| (store |c_old(#length)| v_prenex_30 .cse6)) (= (select |c_old(#valid)| v_prenex_30) 0)))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int)) (let ((.cse7 (mod (* v_prenex_27 v_prenex_28) 4294967296))) (and (= (select |c_#length| v_prenex_26) .cse7) (<= .cse7 2147483647)))))) is different from true [2018-02-04 12:34:58,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:58,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:58,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 66 [2018-02-04 12:34:58,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:58,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:58,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:58,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-02-04 12:34:58,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:58,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:58,986 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 53 treesize of output 56 [2018-02-04 12:34:58,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:59,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:59,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:59,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-02-04 12:34:59,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:59,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:59,419 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 51 treesize of output 54 [2018-02-04 12:34:59,420 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:59,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:59,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:59,566 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 55 treesize of output 68 [2018-02-04 12:34:59,566 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:59,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:59,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:59,707 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 54 treesize of output 48 [2018-02-04 12:34:59,708 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:59,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:59,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:34:59,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-02-04 12:34:59,839 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:34:59,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-02-04 12:34:59,953 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:213, output treesize:177 [2018-02-04 12:35:26,226 WARN L146 SmtUtils]: Spent 26217ms on a formula simplification. DAG size of input: 96 DAG size of output 65 [2018-02-04 12:35:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 418 proven. 9 refuted. 0 times theorem prover too weak. 411 trivial. 47 not checked. [2018-02-04 12:35:26,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:35:26,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 12:35:26,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:35:26,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:35:26,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=408, Unknown=6, NotChecked=172, Total=650 [2018-02-04 12:35:26,308 INFO L87 Difference]: Start difference. First operand 389 states and 496 transitions. Second operand 26 states. [2018-02-04 12:35:26,976 WARN L146 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 79 DAG size of output 51 [2018-02-04 12:35:44,446 WARN L146 SmtUtils]: Spent 17282ms on a formula simplification. DAG size of input: 78 DAG size of output 76 [2018-02-04 12:35:45,578 WARN L146 SmtUtils]: Spent 862ms on a formula simplification. DAG size of input: 70 DAG size of output 45 [2018-02-04 12:36:39,588 WARN L146 SmtUtils]: Spent 50937ms on a formula simplification. DAG size of input: 128 DAG size of output 55 [2018-02-04 12:36:41,962 WARN L146 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 117 DAG size of output 48 [2018-02-04 12:36:48,134 WARN L146 SmtUtils]: Spent 6090ms on a formula simplification. DAG size of input: 113 DAG size of output 46 [2018-02-04 12:36:54,427 WARN L146 SmtUtils]: Spent 6238ms on a formula simplification. DAG size of input: 113 DAG size of output 46 [2018-02-04 12:37:11,530 WARN L146 SmtUtils]: Spent 9934ms on a formula simplification. DAG size of input: 94 DAG size of output 62 [2018-02-04 12:37:14,457 WARN L146 SmtUtils]: Spent 2878ms on a formula simplification. DAG size of input: 70 DAG size of output 36 Received shutdown request... [2018-02-04 12:37:20,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:37:21,000 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 12:37:21,004 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 12:37:21,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:37:21 BoogieIcfgContainer [2018-02-04 12:37:21,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:37:21,005 INFO L168 Benchmark]: Toolchain (without parser) took 225263.73 ms. Allocated memory was 389.0 MB in the beginning and 671.6 MB in the end (delta: 282.6 MB). Free memory was 345.9 MB in the beginning and 419.2 MB in the end (delta: -73.3 MB). Peak memory consumption was 209.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:37:21,005 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 389.0 MB. Free memory is still 352.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:37:21,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.81 ms. Allocated memory is still 389.0 MB. Free memory was 345.9 MB in the beginning and 332.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:37:21,006 INFO L168 Benchmark]: Boogie Preprocessor took 32.91 ms. Allocated memory is still 389.0 MB. Free memory was 332.7 MB in the beginning and 331.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:37:21,006 INFO L168 Benchmark]: RCFGBuilder took 487.28 ms. Allocated memory is still 389.0 MB. Free memory was 331.4 MB in the beginning and 271.6 MB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:37:21,006 INFO L168 Benchmark]: TraceAbstraction took 224563.61 ms. Allocated memory was 389.0 MB in the beginning and 671.6 MB in the end (delta: 282.6 MB). Free memory was 271.6 MB in the beginning and 419.2 MB in the end (delta: -147.6 MB). Peak memory consumption was 135.0 MB. Max. memory is 5.3 GB. [2018-02-04 12:37:21,007 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 389.0 MB. Free memory is still 352.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.81 ms. Allocated memory is still 389.0 MB. Free memory was 345.9 MB in the beginning and 332.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.91 ms. Allocated memory is still 389.0 MB. Free memory was 332.7 MB in the beginning and 331.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 487.28 ms. Allocated memory is still 389.0 MB. Free memory was 331.4 MB in the beginning and 271.6 MB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 224563.61 ms. Allocated memory was 389.0 MB in the beginning and 671.6 MB in the end (delta: 282.6 MB). Free memory was 271.6 MB in the beginning and 419.2 MB in the end (delta: -147.6 MB). Peak memory consumption was 135.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (389states) and interpolant automaton (currently 23 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (516 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 265 locations, 81 error locations. TIMEOUT Result, 224.5s OverallTime, 12 OverallIterations, 30 TraceHistogramMax, 167.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3055 SDtfs, 1304 SDslu, 16522 SDs, 0 SdLazy, 6490 SolverSat, 211 SolverUnsat, 34 SolverUnknown, 0 SolverNotchecked, 64.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1320 GetRequests, 1178 SyntacticMatches, 5 SemanticMatches, 137 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 147.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 177 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 7.9s SatisfiabilityAnalysisTime, 48.0s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 983 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1273 ConstructedInterpolants, 57 QuantifiedInterpolants, 841131 SizeOfPredicates, 54 NumberOfNonLiveVariables, 4860 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 3761/3883 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-37-21-014.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0235_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-37-21-014.csv Completed graceful shutdown