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-a74eeac-m [2018-02-02 18:38:53,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:38:53,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:38:53,793 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:38:53,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:38:53,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:38:53,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:38:53,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:38:53,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:38:53,796 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:38:53,797 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:38:53,797 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:38:53,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:38:53,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:38:53,799 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:38:53,801 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:38:53,803 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:38:53,804 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:38:53,805 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:38:53,806 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:38:53,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:38:53,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:38:53,808 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:38:53,809 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:38:53,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:38:53,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:38:53,810 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:38:53,811 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:38:53,811 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:38:53,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:38:53,811 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:38:53,812 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:38:53,821 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:38:53,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:38:53,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:38:53,822 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:38:53,822 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:38:53,823 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:38:53,823 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:38:53,823 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:38:53,823 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:38:53,823 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:38:53,823 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:38:53,823 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:38:53,824 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:38:53,824 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:38:53,824 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:38:53,824 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:38:53,824 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:38:53,824 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:38:53,825 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:38:53,825 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:38:53,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:38:53,825 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:38:53,825 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:38:53,825 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:38:53,825 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:38:53,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:38:53,861 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:38:53,864 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:38:53,865 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:38:53,865 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:38:53,866 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-02 18:38:53,993 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:38:53,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:38:53,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:38:53,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:38:53,998 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:38:53,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:38:53" (1/1) ... [2018-02-02 18:38:54,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3390db28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:38:54, skipping insertion in model container [2018-02-02 18:38:54,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:38:53" (1/1) ... [2018-02-02 18:38:54,012 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:38:54,042 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:38:54,134 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:38:54,151 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:38:54,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:38:54 WrapperNode [2018-02-02 18:38:54,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:38:54,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:38:54,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:38:54,162 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:38:54,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:38:54" (1/1) ... [2018-02-02 18:38:54,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:38:54" (1/1) ... [2018-02-02 18:38:54,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:38:54" (1/1) ... [2018-02-02 18:38:54,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:38:54" (1/1) ... [2018-02-02 18:38:54,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:38:54" (1/1) ... [2018-02-02 18:38:54,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:38:54" (1/1) ... [2018-02-02 18:38:54,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:38:54" (1/1) ... [2018-02-02 18:38:54,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:38:54,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:38:54,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:38:54,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:38:54,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:38:54" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:38:54,228 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:38:54,228 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:38:54,228 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-02 18:38:54,228 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-02 18:38:54,228 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-02 18:38:54,228 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-02 18:38:54,228 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-02 18:38:54,228 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-02 18:38:54,228 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-02 18:38:54,228 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-02 18:38:54,229 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-02 18:38:54,229 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-02 18:38:54,229 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-02 18:38:54,229 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-02 18:38:54,229 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:38:54,229 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:38:54,229 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:38:54,229 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:38:54,229 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:38:54,229 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:38:54,229 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 18:38:54,229 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 18:38:54,229 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:38:54,229 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:38:54,229 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-02 18:38:54,230 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-02 18:38:54,231 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:38:54,231 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:38:54,231 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:38:54,499 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 18:38:54,692 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:38:54,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:38:54 BoogieIcfgContainer [2018-02-02 18:38:54,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:38:54,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:38:54,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:38:54,697 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:38:54,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:38:53" (1/3) ... [2018-02-02 18:38:54,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301e20b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:38:54, skipping insertion in model container [2018-02-02 18:38:54,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:38:54" (2/3) ... [2018-02-02 18:38:54,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301e20b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:38:54, skipping insertion in model container [2018-02-02 18:38:54,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:38:54" (3/3) ... [2018-02-02 18:38:54,699 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0235_false-valid-memtrack.i [2018-02-02 18:38:54,706 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:38:54,712 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 81 error locations. [2018-02-02 18:38:54,744 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:38:54,744 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:38:54,744 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:38:54,744 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:38:54,745 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:38:54,745 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:38:54,745 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:38:54,745 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:38:54,746 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:38:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states. [2018-02-02 18:38:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:38:54,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:54,769 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:38:54,770 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-02 18:38:54,774 INFO L82 PathProgramCache]: Analyzing trace with hash 14892544, now seen corresponding path program 1 times [2018-02-02 18:38:54,775 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:54,776 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:54,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:54,816 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:54,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:38:54,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:38:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:38:54,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:38:54,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:38:54,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:38:54,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:38:54,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:38:54,971 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 3 states. [2018-02-02 18:38:55,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:38:55,233 INFO L93 Difference]: Finished difference Result 378 states and 430 transitions. [2018-02-02 18:38:55,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:38:55,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:38:55,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:38:55,247 INFO L225 Difference]: With dead ends: 378 [2018-02-02 18:38:55,247 INFO L226 Difference]: Without dead ends: 375 [2018-02-02 18:38:55,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:38:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-02-02 18:38:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 331. [2018-02-02 18:38:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-02 18:38:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 406 transitions. [2018-02-02 18:38:55,298 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 406 transitions. Word has length 4 [2018-02-02 18:38:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:38:55,299 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 406 transitions. [2018-02-02 18:38:55,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:38:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 406 transitions. [2018-02-02 18:38:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:38:55,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:55,299 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:38:55,299 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-02 18:38:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash 14892545, now seen corresponding path program 1 times [2018-02-02 18:38:55,300 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:55,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:55,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:55,300 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:55,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:38:55,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:38:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:38:55,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:38:55,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:38:55,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:38:55,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:38:55,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:38:55,359 INFO L87 Difference]: Start difference. First operand 331 states and 406 transitions. Second operand 3 states. [2018-02-02 18:38:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:38:55,469 INFO L93 Difference]: Finished difference Result 338 states and 416 transitions. [2018-02-02 18:38:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:38:55,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:38:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:38:55,472 INFO L225 Difference]: With dead ends: 338 [2018-02-02 18:38:55,472 INFO L226 Difference]: Without dead ends: 338 [2018-02-02 18:38:55,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:38:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-02 18:38:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 330. [2018-02-02 18:38:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 18:38:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 405 transitions. [2018-02-02 18:38:55,489 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 405 transitions. Word has length 4 [2018-02-02 18:38:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:38:55,490 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 405 transitions. [2018-02-02 18:38:55,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:38:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 405 transitions. [2018-02-02 18:38:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 18:38:55,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:55,490 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:38:55,490 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-02 18:38:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash -948681041, now seen corresponding path program 1 times [2018-02-02 18:38:55,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:55,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:55,491 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:55,492 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:55,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:55,505 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:38:55,506 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:38:55,506 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:38:55,511 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:38:55,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:38:55,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:38:55,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:55,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:38:55,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 18:38:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:38:55,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:38:55,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:38:55,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:38:55,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:38:55,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:38:55,590 INFO L87 Difference]: Start difference. First operand 330 states and 405 transitions. Second operand 4 states. [2018-02-02 18:38:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:38:55,737 INFO L93 Difference]: Finished difference Result 329 states and 404 transitions. [2018-02-02 18:38:55,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:38:55,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 18:38:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:38:55,739 INFO L225 Difference]: With dead ends: 329 [2018-02-02 18:38:55,739 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 18:38:55,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:38:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 18:38:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-02-02 18:38:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-02-02 18:38:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 404 transitions. [2018-02-02 18:38:55,750 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 404 transitions. Word has length 17 [2018-02-02 18:38:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:38:55,751 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 404 transitions. [2018-02-02 18:38:55,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:38:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 404 transitions. [2018-02-02 18:38:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 18:38:55,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:55,751 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:38:55,751 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-02 18:38:55,752 INFO L82 PathProgramCache]: Analyzing trace with hash -948681040, now seen corresponding path program 1 times [2018-02-02 18:38:55,752 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:55,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:55,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:55,753 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:55,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:55,763 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:38:55,763 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:38:55,763 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:38:55,770 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:38:55,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:38:55,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-02-02 18:38:55,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:55,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-02 18:38:55,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:55,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:38:55,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-02 18:38:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:38:55,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:38:55,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:38:55,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:38:55,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:38:55,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:38:55,875 INFO L87 Difference]: Start difference. First operand 329 states and 404 transitions. Second operand 4 states. [2018-02-02 18:38:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:38:56,040 INFO L93 Difference]: Finished difference Result 328 states and 403 transitions. [2018-02-02 18:38:56,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:38:56,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 18:38:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:38:56,042 INFO L225 Difference]: With dead ends: 328 [2018-02-02 18:38:56,042 INFO L226 Difference]: Without dead ends: 328 [2018-02-02 18:38:56,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:38:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-02 18:38:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-02-02 18:38:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 18:38:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 403 transitions. [2018-02-02 18:38:56,055 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 403 transitions. Word has length 17 [2018-02-02 18:38:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:38:56,055 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 403 transitions. [2018-02-02 18:38:56,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:38:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 403 transitions. [2018-02-02 18:38:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 18:38:56,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:56,058 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:38:56,058 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-02 18:38:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash -21730712, now seen corresponding path program 1 times [2018-02-02 18:38:56,059 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:56,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:56,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:56,060 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:56,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:56,077 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:38:56,077 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:38:56,077 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) [2018-02-02 18:38:56,085 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:38:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:38:56,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:38:56,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:38:56,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:56,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:38:56,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 18:38:56,236 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1)))) is different from true [2018-02-02 18:38:56,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:38:56,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-02 18:38:56,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:56,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:38:56,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 18:38:56,251 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~0.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~0.base_BEFORE_CALL_1))) (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1))))) is different from true [2018-02-02 18:38:56,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:38:56,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:38:56,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:38:56,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:56,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:38:56,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-02 18:38:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-02-02 18:38:56,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:38:56,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 18:38:56,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:38:56,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:38:56,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-02 18:38:56,339 INFO L87 Difference]: Start difference. First operand 328 states and 403 transitions. Second operand 15 states. [2018-02-02 18:38:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:38:57,233 INFO L93 Difference]: Finished difference Result 496 states and 607 transitions. [2018-02-02 18:38:57,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:38:57,234 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-02 18:38:57,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:38:57,237 INFO L225 Difference]: With dead ends: 496 [2018-02-02 18:38:57,237 INFO L226 Difference]: Without dead ends: 496 [2018-02-02 18:38:57,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-02-02 18:38:57,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-02-02 18:38:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 371. [2018-02-02 18:38:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-02-02 18:38:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 478 transitions. [2018-02-02 18:38:57,249 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 478 transitions. Word has length 142 [2018-02-02 18:38:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:38:57,249 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 478 transitions. [2018-02-02 18:38:57,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:38:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 478 transitions. [2018-02-02 18:38:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 18:38:57,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:57,251 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:38:57,252 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-02 18:38:57,252 INFO L82 PathProgramCache]: Analyzing trace with hash -21730711, now seen corresponding path program 1 times [2018-02-02 18:38:57,252 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:57,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:57,253 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:57,253 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:57,253 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:57,265 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:38:57,266 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:38:57,266 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:38:57,273 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:38:57,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:38:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 18:38:57,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:38:57,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:38:57,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:38:57,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:38:57,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:38:57,500 INFO L87 Difference]: Start difference. First operand 371 states and 478 transitions. Second operand 8 states. [2018-02-02 18:38:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:38:57,626 INFO L93 Difference]: Finished difference Result 381 states and 488 transitions. [2018-02-02 18:38:57,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:38:57,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-02 18:38:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:38:57,630 INFO L225 Difference]: With dead ends: 381 [2018-02-02 18:38:57,630 INFO L226 Difference]: Without dead ends: 372 [2018-02-02 18:38:57,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:38:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-02-02 18:38:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2018-02-02 18:38:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-02-02 18:38:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 479 transitions. [2018-02-02 18:38:57,640 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 479 transitions. Word has length 142 [2018-02-02 18:38:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:38:57,641 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 479 transitions. [2018-02-02 18:38:57,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:38:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 479 transitions. [2018-02-02 18:38:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 18:38:57,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:57,642 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:38:57,643 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-02 18:38:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2121921167, now seen corresponding path program 1 times [2018-02-02 18:38:57,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:57,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:57,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:57,644 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:57,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:57,656 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:38:57,656 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:38:57,656 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:38:57,666 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:38:57,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:38:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-02 18:38:58,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:38:58,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 18:38:58,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:38:58,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:38:58,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:38:58,005 INFO L87 Difference]: Start difference. First operand 372 states and 479 transitions. Second operand 9 states. [2018-02-02 18:38:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:38:58,110 INFO L93 Difference]: Finished difference Result 382 states and 489 transitions. [2018-02-02 18:38:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:38:58,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-02 18:38:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:38:58,112 INFO L225 Difference]: With dead ends: 382 [2018-02-02 18:38:58,112 INFO L226 Difference]: Without dead ends: 373 [2018-02-02 18:38:58,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:38:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-02 18:38:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-02-02 18:38:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-02 18:38:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-02-02 18:38:58,122 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 148 [2018-02-02 18:38:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:38:58,122 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-02-02 18:38:58,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:38:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-02-02 18:38:58,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 18:38:58,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:58,125 INFO L351 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:38:58,125 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-02 18:38:58,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1794518359, now seen corresponding path program 2 times [2018-02-02 18:38:58,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:58,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:58,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:58,126 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:38:58,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:58,139 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:38:58,139 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:38:58,139 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:38:58,152 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:38:59,705 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:38:59,706 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:38:59,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:39:09,096 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-02 18:39:09,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:39:09,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 18:39:09,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:39:09,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:39:09,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=66, Unknown=7, NotChecked=0, Total=90 [2018-02-02 18:39:09,115 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 10 states. [2018-02-02 18:39:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:39:59,386 INFO L93 Difference]: Finished difference Result 389 states and 499 transitions. [2018-02-02 18:39:59,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:39:59,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-02 18:39:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:39:59,389 INFO L225 Difference]: With dead ends: 389 [2018-02-02 18:39:59,389 INFO L226 Difference]: Without dead ends: 389 [2018-02-02 18:39:59,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=29, Invalid=116, Unknown=11, NotChecked=0, Total=156 [2018-02-02 18:39:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-02 18:39:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-02-02 18:39:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-02-02 18:39:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 499 transitions. [2018-02-02 18:39:59,399 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 499 transitions. Word has length 154 [2018-02-02 18:39:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:39:59,399 INFO L432 AbstractCegarLoop]: Abstraction has 389 states and 499 transitions. [2018-02-02 18:39:59,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:39:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 499 transitions. [2018-02-02 18:39:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-02 18:39:59,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:39:59,402 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-02 18:39:59,402 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-02 18:39:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash -460336454, now seen corresponding path program 3 times [2018-02-02 18:39:59,402 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:39:59,402 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:39:59,403 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:39:59,403 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:39:59,403 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:39:59,414 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:39:59,414 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:39:59,414 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:39:59,421 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:39:59,482 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-02 18:39:59,482 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:39:59,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:39:59,581 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-02 18:39:59,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:39:59,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 18:39:59,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:39:59,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:39:59,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:39:59,599 INFO L87 Difference]: Start difference. First operand 389 states and 499 transitions. Second operand 10 states. [2018-02-02 18:39:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:39:59,711 INFO L93 Difference]: Finished difference Result 396 states and 505 transitions. [2018-02-02 18:39:59,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:39:59,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2018-02-02 18:39:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:39:59,721 INFO L225 Difference]: With dead ends: 396 [2018-02-02 18:39:59,721 INFO L226 Difference]: Without dead ends: 387 [2018-02-02 18:39:59,721 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-02 18:39:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-02 18:39:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-02-02 18:39:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-02 18:39:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 494 transitions. [2018-02-02 18:39:59,728 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 494 transitions. Word has length 159 [2018-02-02 18:39:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:39:59,728 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 494 transitions. [2018-02-02 18:39:59,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:39:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 494 transitions. [2018-02-02 18:39:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-02 18:39:59,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:39:59,730 INFO L351 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:39:59,730 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-02 18:39:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash -209330255, now seen corresponding path program 4 times [2018-02-02 18:39:59,730 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:39:59,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:39:59,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:39:59,731 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:39:59,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:39:59,740 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:39:59,740 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:39:59,740 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:39:59,748 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 18:40:04,838 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 18:40:04,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:40:04,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:04,933 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-02 18:40:04,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:40:04,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 18:40:04,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:40:04,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:40:04,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:40:04,953 INFO L87 Difference]: Start difference. First operand 387 states and 494 transitions. Second operand 13 states. [2018-02-02 18:40:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:05,116 INFO L93 Difference]: Finished difference Result 404 states and 511 transitions. [2018-02-02 18:40:05,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 18:40:05,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 160 [2018-02-02 18:40:05,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:05,119 INFO L225 Difference]: With dead ends: 404 [2018-02-02 18:40:05,119 INFO L226 Difference]: Without dead ends: 388 [2018-02-02 18:40:05,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-02 18:40:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-02 18:40:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-02-02 18:40:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-02 18:40:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 495 transitions. [2018-02-02 18:40:05,127 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 495 transitions. Word has length 160 [2018-02-02 18:40:05,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:05,128 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 495 transitions. [2018-02-02 18:40:05,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:40:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 495 transitions. [2018-02-02 18:40:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-02-02 18:40:05,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:05,130 INFO L351 BasicCegarLoop]: trace histogram [24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:05,130 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-02 18:40:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash -213181719, now seen corresponding path program 5 times [2018-02-02 18:40:05,130 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:05,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:05,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:05,131 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:40:05,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:05,141 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:40:05,141 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:40:05,141 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:40:05,153 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 18:40:05,601 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-02-02 18:40:05,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:40:05,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:05,724 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-02 18:40:05,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:40:05,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 18:40:05,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:40:05,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:40:05,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:40:05,743 INFO L87 Difference]: Start difference. First operand 388 states and 495 transitions. Second operand 12 states. [2018-02-02 18:40:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:40:05,853 INFO L93 Difference]: Finished difference Result 405 states and 512 transitions. [2018-02-02 18:40:05,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:40:05,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-02-02 18:40:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:40:05,854 INFO L225 Difference]: With dead ends: 405 [2018-02-02 18:40:05,854 INFO L226 Difference]: Without dead ends: 389 [2018-02-02 18:40:05,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:40:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-02 18:40:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-02-02 18:40:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-02-02 18:40:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 496 transitions. [2018-02-02 18:40:05,860 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 496 transitions. Word has length 166 [2018-02-02 18:40:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:40:05,860 INFO L432 AbstractCegarLoop]: Abstraction has 389 states and 496 transitions. [2018-02-02 18:40:05,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:40:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 496 transitions. [2018-02-02 18:40:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 18:40:05,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:40:05,861 INFO L351 BasicCegarLoop]: trace histogram [30, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:40:05,861 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-02 18:40:05,862 INFO L82 PathProgramCache]: Analyzing trace with hash -607972879, now seen corresponding path program 6 times [2018-02-02 18:40:05,862 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:40:05,862 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:40:05,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:05,862 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:40:05,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:40:05,870 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:40:05,871 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:40:05,871 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:40:05,878 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 18:40:06,574 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-02 18:40:06,574 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:40:06,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:40:06,590 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-02 18:40:06,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:06,617 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-02 18:40:06,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:06,644 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-02 18:40:06,645 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:06,646 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-02 18:40:06,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:06,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:40:06,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-02 18:40:06,834 WARN L143 SmtUtils]: Spent 148ms on a formula simplification that was a NOOP. DAG size: 28 [2018-02-02 18:40:09,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-02 18:40:09,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:09,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-02-02 18:40:09,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:10,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-02 18:40:10,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:10,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-02-02 18:40:10,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:10,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-02 18:40:10,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-02 18:40:18,754 WARN L143 SmtUtils]: Spent 2682ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-02 18:40:18,767 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-02 18:40:18,778 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-02 18:40:18,804 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-02 18:40:18,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:18,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:18,830 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-02 18:40:18,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:19,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:19,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:19,078 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-02 18:40:19,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:19,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:19,314 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-02 18:40:19,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:19,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:19,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:19,505 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-02 18:40:19,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:19,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:19,729 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-02 18:40:19,729 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:19,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:19,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:19,903 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-02 18:40:19,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:20,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:20,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:20,021 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-02 18:40:20,021 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:20,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:20,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:40:20,152 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-02 18:40:20,153 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:40:20,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-02-02 18:40:20,255 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:213, output treesize:177 Received shutdown request... [2018-02-02 18:40:42,293 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 18:40:42,293 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:40:42,297 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:40:42,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:40:42 BoogieIcfgContainer [2018-02-02 18:40:42,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:40:42,298 INFO L168 Benchmark]: Toolchain (without parser) took 108304.28 ms. Allocated memory was 403.2 MB in the beginning and 695.7 MB in the end (delta: 292.6 MB). Free memory was 360.1 MB in the beginning and 557.6 MB in the end (delta: -197.5 MB). Peak memory consumption was 95.1 MB. Max. memory is 5.3 GB. [2018-02-02 18:40:42,298 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:40:42,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.45 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 346.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 18:40:42,299 INFO L168 Benchmark]: Boogie Preprocessor took 30.36 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 345.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:40:42,299 INFO L168 Benchmark]: RCFGBuilder took 500.58 ms. Allocated memory is still 403.2 MB. Free memory was 345.5 MB in the beginning and 285.8 MB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 5.3 GB. [2018-02-02 18:40:42,299 INFO L168 Benchmark]: TraceAbstraction took 107604.08 ms. Allocated memory was 403.2 MB in the beginning and 695.7 MB in the end (delta: 292.6 MB). Free memory was 285.8 MB in the beginning and 557.6 MB in the end (delta: -271.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. [2018-02-02 18:40:42,301 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.13 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.45 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 346.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.36 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 345.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 500.58 ms. Allocated memory is still 403.2 MB. Free memory was 345.5 MB in the beginning and 285.8 MB in the end (delta: 59.7 MB). Peak memory consumption was 59.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 107604.08 ms. Allocated memory was 403.2 MB in the beginning and 695.7 MB in the end (delta: 292.6 MB). Free memory was 285.8 MB in the beginning and 557.6 MB in the end (delta: -271.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 831). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 832). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 834). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 820). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 881). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 885). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 886). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 882). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 884). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 875]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 875). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 877). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 855). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 856). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 846). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 173 with TraceHistMax 30, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 96. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 265 locations, 81 error locations. TIMEOUT Result, 107.5s OverallTime, 12 OverallIterations, 30 TraceHistogramMax, 52.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2899 SDtfs, 844 SDslu, 15614 SDs, 0 SdLazy, 2854 SolverSat, 132 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 45.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1129 GetRequests, 1029 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 16.1s 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.4s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1113 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1102 ConstructedInterpolants, 27 QuantifiedInterpolants, 330525 SizeOfPredicates, 41 NumberOfNonLiveVariables, 4444 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 2932/2998 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-02_18-40-42-308.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-02_18-40-42-308.csv Completed graceful shutdown