java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:14:16,717 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:14:16,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:14:16,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:14:16,750 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:14:16,751 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:14:16,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:14:16,754 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:14:16,756 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:14:16,757 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:14:16,759 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:14:16,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:14:16,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:14:16,762 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:14:16,763 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:14:16,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:14:16,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:14:16,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:14:16,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:14:16,774 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:14:16,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:14:16,778 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:14:16,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:14:16,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:14:16,781 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:14:16,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:14:16,782 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:14:16,783 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:14:16,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:14:16,784 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:14:16,785 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:14:16,785 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-24 23:14:16,796 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:14:16,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:14:16,797 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:14:16,798 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:14:16,798 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:14:16,798 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:14:16,798 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:14:16,798 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:14:16,801 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:14:16,802 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:14:16,802 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:14:16,802 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:14:16,802 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:14:16,802 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:14:16,803 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:14:16,803 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:14:16,803 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:14:16,803 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:14:16,803 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:14:16,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:14:16,804 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:14:16,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:14:16,806 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:14:16,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:14:16,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:14:16,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:14:16,807 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:14:16,807 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:14:16,807 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:14:16,807 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:14:16,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:14:16,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:14:16,808 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:14:16,808 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:14:16,810 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:14:16,810 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:14:16,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:14:16,870 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:14:16,875 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:14:16,876 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:14:16,876 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:14:16,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:14:17,029 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:14:17,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:14:17,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:14:17,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:14:17,047 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:14:17,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:14:17" (1/1) ... [2018-01-24 23:14:17,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdf0e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:17, skipping insertion in model container [2018-01-24 23:14:17,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:14:17" (1/1) ... [2018-01-24 23:14:17,075 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:14:17,126 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:14:17,245 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:14:17,264 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:14:17,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:17 WrapperNode [2018-01-24 23:14:17,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:14:17,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:14:17,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:14:17,273 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:14:17,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:17" (1/1) ... [2018-01-24 23:14:17,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:17" (1/1) ... [2018-01-24 23:14:17,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:17" (1/1) ... [2018-01-24 23:14:17,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:17" (1/1) ... [2018-01-24 23:14:17,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:17" (1/1) ... [2018-01-24 23:14:17,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:17" (1/1) ... [2018-01-24 23:14:17,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:17" (1/1) ... [2018-01-24 23:14:17,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:14:17,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:14:17,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:14:17,313 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:14:17,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:17" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:14:17,364 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:14:17,364 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:14:17,364 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:14:17,364 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:14:17,364 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:14:17,365 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:14:17,365 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:14:17,365 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:14:17,365 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:14:17,365 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:14:17,365 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:14:17,366 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:14:17,579 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:14:17,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:14:17 BoogieIcfgContainer [2018-01-24 23:14:17,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:14:17,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:14:17,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:14:17,583 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:14:17,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:14:17" (1/3) ... [2018-01-24 23:14:17,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d9ed01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:14:17, skipping insertion in model container [2018-01-24 23:14:17,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:17" (2/3) ... [2018-01-24 23:14:17,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d9ed01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:14:17, skipping insertion in model container [2018-01-24 23:14:17,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:14:17" (3/3) ... [2018-01-24 23:14:17,588 INFO L105 eAbstractionObserver]: Analyzing ICFG mult_array-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:14:17,597 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:14:17,603 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 23:14:17,641 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:14:17,641 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:14:17,641 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:14:17,642 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:14:17,642 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:14:17,642 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:14:17,642 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:14:17,642 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:14:17,643 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:14:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 23:14:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 23:14:17,667 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:17,668 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:14:17,668 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:14:17,674 INFO L82 PathProgramCache]: Analyzing trace with hash 83465695, now seen corresponding path program 1 times [2018-01-24 23:14:17,677 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:17,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:17,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:17,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:17,723 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:17,768 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 23:14:17,769 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 23:14:17,769 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 23:14:17,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:17,779 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 23:14:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:17,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-01-24 23:14:17,836 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 23:14:17,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:14:17,837 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:14:17,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:17,846 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:14:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:17,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:14:17,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:14:17,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:17,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:14:17,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 23:14:18,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-01-24 23:14:18,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:18,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 23:14:18,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 23:14:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:18,066 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:14:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:18,133 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:14:18,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-01-24 23:14:18,133 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:14:18,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:14:18,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:14:18,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:14:18,244 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-01-24 23:14:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:18,359 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-01-24 23:14:18,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:14:18,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 23:14:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:18,373 INFO L225 Difference]: With dead ends: 66 [2018-01-24 23:14:18,373 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 23:14:18,377 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:14:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 23:14:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 23:14:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 23:14:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 23:14:18,411 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 17 [2018-01-24 23:14:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:18,411 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 23:14:18,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:14:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 23:14:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 23:14:18,412 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:18,412 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:14:18,412 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:14:18,413 INFO L82 PathProgramCache]: Analyzing trace with hash 83465696, now seen corresponding path program 1 times [2018-01-24 23:14:18,413 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:18,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:18,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:18,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:18,414 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:18,424 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 23:14:18,424 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 23:14:18,424 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 23:14:18,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:18,437 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 23:14:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:18,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-01-24 23:14:18,473 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 23:14:18,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:14:18,474 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:14:18,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:18,480 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:14:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:18,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:14:18,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:14:18,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:18,561 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 8 treesize of output 7 [2018-01-24 23:14:18,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:18,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:14:18,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-24 23:14:18,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:14:18,624 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 18 treesize of output 21 [2018-01-24 23:14:18,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:18,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:14:18,700 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:14:18,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 23:14:18,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:18,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 23:14:18,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:27 [2018-01-24 23:14:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:18,862 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:14:19,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 3 [2018-01-24 23:14:19,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:19,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 23:14:19,109 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 23:14:19,110 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:19,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 23:14:19,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:19,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:14:19,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:14:19,123 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 [2018-01-24 23:14:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:19,205 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:14:19,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2018-01-24 23:14:19,206 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:14:19,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:14:19,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:14:19,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:14:19,208 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-01-24 23:14:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:19,560 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-24 23:14:19,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:14:19,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-24 23:14:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:19,562 INFO L225 Difference]: With dead ends: 64 [2018-01-24 23:14:19,562 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 23:14:19,564 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:14:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 23:14:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-01-24 23:14:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 23:14:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 23:14:19,572 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2018-01-24 23:14:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:19,572 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 23:14:19,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:14:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 23:14:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:14:19,573 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:19,573 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:14:19,573 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:14:19,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1544748661, now seen corresponding path program 1 times [2018-01-24 23:14:19,574 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:19,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:19,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:19,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:19,575 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:19,582 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 23:14:19,583 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 23:14:19,583 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 23:14:19,592 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:19,592 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 23:14:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:19,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-01-24 23:14:19,624 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 23:14:19,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:14:19,625 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:14:19,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:19,633 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:14:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:19,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:14:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:19,672 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:14:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:19,711 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:14:19,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-01-24 23:14:19,712 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:14:19,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:14:19,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:14:19,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:14:19,713 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 23:14:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:19,816 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-24 23:14:19,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:14:19,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 23:14:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:19,818 INFO L225 Difference]: With dead ends: 46 [2018-01-24 23:14:19,818 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 23:14:19,819 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:14:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 23:14:19,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 23:14:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 23:14:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 23:14:19,828 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-01-24 23:14:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:19,829 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 23:14:19,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:14:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 23:14:19,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:14:19,830 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:19,830 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:14:19,830 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:14:19,830 INFO L82 PathProgramCache]: Analyzing trace with hash -301838139, now seen corresponding path program 1 times [2018-01-24 23:14:19,830 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:19,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:19,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:19,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:19,832 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:19,841 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 23:14:19,841 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 23:14:19,841 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 23:14:19,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:19,855 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 23:14:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:19,901 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-24 23:14:19,903 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [17], [19], [20], [21], [22], [30], [34], [39], [40], [42], [43], [45], [78], [79], [80] [2018-01-24 23:14:19,955 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:14:19,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:14:27,858 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:14:27,859 INFO L268 AbstractInterpreter]: Visited 20 different actions 26 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-24 23:14:27,888 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:14:27,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:14:27,889 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:14:27,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:27,894 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:14:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:27,913 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:14:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:27,942 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:14:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:27,982 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:14:27,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-01-24 23:14:27,982 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:14:27,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:14:27,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:14:27,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:14:27,983 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-24 23:14:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:28,030 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-01-24 23:14:28,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:14:28,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 23:14:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:28,032 INFO L225 Difference]: With dead ends: 94 [2018-01-24 23:14:28,032 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 23:14:28,032 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:14:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 23:14:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2018-01-24 23:14:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 23:14:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-24 23:14:28,041 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 22 [2018-01-24 23:14:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:28,041 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-24 23:14:28,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:14:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-24 23:14:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:14:28,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:28,042 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:14:28,042 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:14:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1322906493, now seen corresponding path program 1 times [2018-01-24 23:14:28,042 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:28,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:28,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:28,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:28,043 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:28,050 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 23:14:28,051 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 23:14:28,051 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/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-01-24 23:14:28,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:28,063 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 23:14:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:28,098 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-24 23:14:28,098 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [17], [19], [20], [21], [22], [30], [34], [39], [40], [42], [43], [45], [78], [79], [80] [2018-01-24 23:14:28,099 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:14:28,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:14:34,134 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:14:34,134 INFO L268 AbstractInterpreter]: Visited 20 different actions 26 times. Merged at 6 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-24 23:14:34,143 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:14:34,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:14:34,143 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:14:34,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:34,149 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:14:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:34,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:14:34,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:14:34,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:34,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 8 treesize of output 7 [2018-01-24 23:14:34,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:34,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:14:34,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 23:14:34,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:14:34,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:14:34,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 23:14:34,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:34,207 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 18 treesize of output 21 [2018-01-24 23:14:34,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:34,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 23:14:34,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:24 [2018-01-24 23:14:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:34,407 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:14:36,584 WARN L143 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 40 [2018-01-24 23:14:38,686 WARN L143 SmtUtils]: Spent 2065ms on a formula simplification that was a NOOP. DAG size: 40 [2018-01-24 23:14:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:38,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:14:38,727 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 23:14:38,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:38,732 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:14:38,759 ERROR L243 seRefinementStrategy]: Caught known exception: A non-linear fact was asserted to arithmetic in a linear logic. [2018-01-24 23:14:38,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 23:14:38,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-01-24 23:14:38,760 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 23:14:38,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 23:14:38,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 23:14:38,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-01-24 23:14:38,761 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 14 states. [2018-01-24 23:14:39,006 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 56 DAG size of output 55 [2018-01-24 23:14:39,312 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 52 DAG size of output 46 [2018-01-24 23:14:39,786 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 39 DAG size of output 37 [2018-01-24 23:14:40,125 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 37 DAG size of output 35 [2018-01-24 23:14:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:43,976 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-01-24 23:14:43,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 23:14:43,977 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-01-24 23:14:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:43,978 INFO L225 Difference]: With dead ends: 56 [2018-01-24 23:14:43,978 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 23:14:43,978 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2018-01-24 23:14:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 23:14:43,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-24 23:14:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 23:14:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-24 23:14:43,988 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 22 [2018-01-24 23:14:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:43,989 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-24 23:14:43,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 23:14:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-24 23:14:43,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 23:14:43,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:43,990 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:14:43,990 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:14:43,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1599933162, now seen corresponding path program 1 times [2018-01-24 23:14:43,991 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:43,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:43,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:43,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:43,992 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:44,000 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 23:14:44,000 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 23:14:44,000 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 23:14:44,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:44,013 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 23:14:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:44,041 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 23:14:44,041 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [17], [19], [20], [21], [22], [30], [34], [37], [39], [40], [43], [45], [49], [53], [58], [61], [78], [79], [80] [2018-01-24 23:14:44,042 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:14:44,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:14:48,560 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:14:48,561 INFO L268 AbstractInterpreter]: Visited 24 different actions 34 times. Merged at 10 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-24 23:14:48,568 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:14:48,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:14:48,569 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:14:48,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:48,574 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:14:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:48,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:14:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:48,670 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:14:48,854 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 64 DAG size of output 38 [2018-01-24 23:14:49,047 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse4 (<= 0 c_main_~length~2)) (.cse3 (< c_main_~length~2 0))) (and (forall ((v_main_~i~2_26 Int)) (let ((.cse2 (mod v_main_~i~2_26 c_main_~length~2))) (let ((.cse1 (* 4 c_main_~length~2)) (.cse0 (* 4 .cse2))) (or (< v_main_~i~2_26 (+ c_main_~i~2 1)) (<= 0 (+ .cse0 c_main_~arr~2.offset .cse1)) (<= 0 v_main_~i~2_26) (<= .cse1 (+ .cse0 c_main_~arr~2.offset)) (= .cse2 0))))) (or .cse3 (forall ((v_prenex_9 Int)) (or (< v_prenex_9 (+ c_main_~i~2 1)) (<= 0 v_prenex_9) (= (mod v_prenex_9 c_main_~length~2) 0))) .cse4) (forall ((v_prenex_8 Int)) (let ((.cse8 (* 4 (mod v_prenex_8 c_main_~length~2)))) (let ((.cse5 (+ .cse8 c_main_~arr~2.offset 4)) (.cse7 (* 4 c_main_~length~2)) (.cse6 (select |c_#length| c_main_~arr~2.base))) (or (<= .cse5 (+ .cse6 .cse7)) (< v_prenex_8 (+ c_main_~i~2 1)) (<= .cse5 .cse6) (<= (+ .cse8 c_main_~arr~2.offset .cse7 4) .cse6))))) (or .cse4 (forall ((v_prenex_10 Int)) (let ((.cse9 (mod v_prenex_10 c_main_~length~2))) (or (< v_prenex_10 (+ c_main_~i~2 1)) (<= 0 v_prenex_10) (= .cse9 0) (<= 0 (+ c_main_~arr~2.offset (* 4 c_main_~length~2) (* 4 .cse9))))))) (forall ((v_prenex_12 Int)) (let ((.cse10 (* 4 (mod v_prenex_12 c_main_~length~2)))) (let ((.cse11 (* 4 c_main_~length~2)) (.cse12 (+ c_main_~arr~2.offset .cse10))) (or (<= 0 (+ c_main_~arr~2.offset .cse10 .cse11)) (<= .cse11 .cse12) (<= 0 .cse12) (< v_prenex_12 (+ c_main_~i~2 1)))))) (or (forall ((v_prenex_13 Int)) (let ((.cse13 (* 4 (mod v_prenex_13 c_main_~length~2)))) (or (<= 0 (+ .cse13 c_main_~arr~2.offset)) (< v_prenex_13 (+ c_main_~i~2 1)) (<= 0 (+ .cse13 c_main_~arr~2.offset (* 4 c_main_~length~2)))))) .cse4) (or .cse3 (forall ((v_prenex_6 Int)) (let ((.cse14 (+ (* 4 (mod v_prenex_6 c_main_~length~2)) c_main_~arr~2.offset))) (or (<= (* 4 c_main_~length~2) .cse14) (< v_prenex_6 (+ c_main_~i~2 1)) (<= 0 .cse14))))) (or .cse3 (forall ((v_prenex_5 Int)) (or (< v_prenex_5 (+ c_main_~i~2 1)) (<= 0 (+ c_main_~arr~2.offset (* 4 (mod v_prenex_5 c_main_~length~2)))))) .cse4) (forall ((v_prenex_14 Int)) (or (< v_prenex_14 (+ c_main_~i~2 1)) (<= (+ c_main_~arr~2.offset (* 4 (mod v_prenex_14 c_main_~length~2)) 4) (select |c_#length| c_main_~arr~2.base)) (< v_prenex_14 0))) (forall ((v_prenex_11 Int)) (let ((.cse15 (mod v_prenex_11 c_main_~length~2))) (or (<= (+ c_main_~arr~2.offset (* 4 .cse15) 4) (select |c_#length| c_main_~arr~2.base)) (< v_prenex_11 (+ c_main_~i~2 1)) (not (= .cse15 0))))) (or .cse3 (forall ((v_prenex_7 Int)) (let ((.cse16 (mod v_prenex_7 c_main_~length~2))) (or (<= 0 v_prenex_7) (= .cse16 0) (< v_prenex_7 (+ c_main_~i~2 1)) (<= (* 4 c_main_~length~2) (+ (* 4 .cse16) c_main_~arr~2.offset)))))))) is different from false [2018-01-24 23:14:49,075 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-01-24 23:14:49,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:49,328 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-01-24 23:14:49,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:49,714 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-01-24 23:14:49,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:49,980 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-01-24 23:14:49,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:50,137 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-01-24 23:14:50,137 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:50,333 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-01-24 23:14:50,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:52,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2018-01-24 23:14:52,967 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:53,186 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-01-24 23:14:53,187 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:53,437 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-01-24 23:14:53,438 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 23:14:56,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 22 dim-0 vars, 11 dim-1 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-01-24 23:14:56,003 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 33 variables, input treesize:448, output treesize:238 [2018-01-24 23:14:58,006 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse10 (<= 0 c_main_~length~2)) (.cse3 (< c_main_~length~2 0))) (and (forall ((v_main_~i~2_26 Int)) (let ((.cse2 (mod v_main_~i~2_26 c_main_~length~2))) (let ((.cse1 (* 4 c_main_~length~2)) (.cse0 (* 4 .cse2))) (or (< v_main_~i~2_26 (+ c_main_~i~2 1)) (<= 0 (+ .cse0 c_main_~arr~2.offset .cse1)) (<= 0 v_main_~i~2_26) (<= .cse1 (+ .cse0 c_main_~arr~2.offset)) (= .cse2 0))))) (or .cse3 (forall ((v_prenex_6 Int)) (or (< v_prenex_6 (+ c_main_~i~2 1)) (<= 0 (+ (* 4 (mod v_prenex_6 c_main_~length~2)) c_main_~arr~2.offset))))) (forall ((v_prenex_12 Int)) (let ((.cse5 (* 4 c_main_~length~2)) (.cse4 (* 4 (mod v_prenex_12 c_main_~length~2)))) (or (<= 0 (+ c_main_~arr~2.offset .cse4 .cse5)) (<= .cse5 (+ c_main_~arr~2.offset .cse4)) (< v_prenex_12 (+ c_main_~i~2 1))))) (forall ((v_prenex_8 Int)) (let ((.cse6 (* 4 (mod v_prenex_8 c_main_~length~2))) (.cse8 (* 4 c_main_~i~2)) (.cse7 (* 4 c_main_~length~2))) (or (< v_prenex_8 (+ c_main_~i~2 1)) (< (+ .cse6 .cse7) (+ .cse8 1)) (< .cse6 (+ .cse8 .cse7 1))))) (forall ((v_prenex_14 Int)) (or (< v_prenex_14 (+ c_main_~i~2 1)) (< v_prenex_14 0) (< (* 4 (mod v_prenex_14 c_main_~length~2)) (+ (* 4 c_main_~i~2) 1)))) (forall ((v_prenex_11 Int)) (let ((.cse9 (mod v_prenex_11 c_main_~length~2))) (or (< v_prenex_11 (+ c_main_~i~2 1)) (not (= .cse9 0)) (< (* 4 .cse9) (+ (* 4 c_main_~i~2) 1))))) (or .cse10 (forall ((v_prenex_10 Int)) (let ((.cse11 (mod v_prenex_10 c_main_~length~2))) (or (< v_prenex_10 (+ c_main_~i~2 1)) (<= 0 v_prenex_10) (= .cse11 0) (<= 0 (+ c_main_~arr~2.offset (* 4 c_main_~length~2) (* 4 .cse11))))))) (or (forall ((v_prenex_13 Int)) (or (<= 0 (+ (* 4 (mod v_prenex_13 c_main_~length~2)) c_main_~arr~2.offset)) (< v_prenex_13 (+ c_main_~i~2 1)))) .cse10) (or .cse3 (forall ((v_prenex_7 Int)) (let ((.cse12 (mod v_prenex_7 c_main_~length~2))) (or (<= 0 v_prenex_7) (= .cse12 0) (< v_prenex_7 (+ c_main_~i~2 1)) (<= (* 4 c_main_~length~2) (+ (* 4 .cse12) c_main_~arr~2.offset)))))))) is different from false [2018-01-24 23:15:00,041 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse5 (< c_main_~length~2 0)) (.cse1 (<= 0 c_main_~length~2))) (and (forall ((v_prenex_14 Int) (v_prenex_35 Int)) (or (< v_prenex_14 0) (< v_prenex_14 (+ v_prenex_35 1)) (< v_prenex_35 0) (< (* 4 (mod v_prenex_14 c_main_~length~2)) (+ (* 4 v_prenex_35) 1)))) (or (forall ((v_prenex_10 Int)) (let ((.cse0 (mod v_prenex_10 c_main_~length~2))) (or (<= 0 v_prenex_10) (= .cse0 0) (<= 0 (+ c_main_~arr~2.offset (* 4 c_main_~length~2) (* 4 .cse0))) (< v_prenex_10 1)))) .cse1) (forall ((v_prenex_11 Int) (v_main_~i~2_27 Int)) (let ((.cse2 (mod v_prenex_11 c_main_~length~2))) (or (< v_main_~i~2_27 0) (not (= .cse2 0)) (< (* 4 .cse2) (+ (* 4 v_main_~i~2_27) 1)) (< v_prenex_11 (+ v_main_~i~2_27 1))))) (forall ((v_prenex_12 Int)) (let ((.cse4 (* 4 c_main_~length~2)) (.cse3 (* 4 (mod v_prenex_12 c_main_~length~2)))) (or (<= 0 (+ c_main_~arr~2.offset .cse3 .cse4)) (<= .cse4 (+ c_main_~arr~2.offset .cse3)) (< v_prenex_12 1)))) (or .cse5 (forall ((v_prenex_6 Int)) (or (< v_prenex_6 1) (<= 0 (+ (* 4 (mod v_prenex_6 c_main_~length~2)) c_main_~arr~2.offset))))) (forall ((v_prenex_37 Int) (v_prenex_8 Int)) (let ((.cse6 (* 4 (mod v_prenex_8 c_main_~length~2))) (.cse8 (* 4 c_main_~length~2)) (.cse7 (* 4 v_prenex_37))) (or (< v_prenex_8 (+ v_prenex_37 1)) (< .cse6 (+ .cse7 .cse8 1)) (< (+ .cse6 .cse8) (+ .cse7 1)) (< v_prenex_37 0)))) (forall ((v_main_~i~2_26 Int)) (let ((.cse11 (mod v_main_~i~2_26 c_main_~length~2))) (let ((.cse10 (* 4 c_main_~length~2)) (.cse9 (* 4 .cse11))) (or (< v_main_~i~2_26 1) (<= 0 (+ .cse9 c_main_~arr~2.offset .cse10)) (<= 0 v_main_~i~2_26) (<= .cse10 (+ .cse9 c_main_~arr~2.offset)) (= .cse11 0))))) (or .cse5 (forall ((v_prenex_7 Int)) (let ((.cse12 (mod v_prenex_7 c_main_~length~2))) (or (<= 0 v_prenex_7) (= .cse12 0) (< v_prenex_7 1) (<= (* 4 c_main_~length~2) (+ (* 4 .cse12) c_main_~arr~2.offset)))))) (or (forall ((v_prenex_13 Int)) (or (< v_prenex_13 1) (<= 0 (+ (* 4 (mod v_prenex_13 c_main_~length~2)) c_main_~arr~2.offset)))) .cse1))) is different from false [2018-01-24 23:15:07,565 WARN L146 SmtUtils]: Spent 5467ms on a formula simplification. DAG size of input: 113 DAG size of output 27 [2018-01-24 23:15:08,151 WARN L1007 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_14 Int) (v_prenex_35 Int)) (or (< v_prenex_14 0) (< v_prenex_14 (+ v_prenex_35 1)) (< v_prenex_35 0) (< (* 4 (mod v_prenex_14 c_main_~length~2)) (+ (* 4 v_prenex_35) 1)))) (forall ((v_prenex_13 Int)) (or (< v_prenex_13 1) (< 0 (+ (* 4 (mod v_prenex_13 c_main_~length~2)) 1))))) is different from false [2018-01-24 23:15:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 23:15:08,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 23:15:08,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-01-24 23:15:08,193 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:15:08,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:15:08,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:15:08,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=63, Unknown=5, NotChecked=76, Total=182 [2018-01-24 23:15:08,194 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-01-24 23:15:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:15:08,330 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-24 23:15:08,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:15:08,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 23:15:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:15:08,333 INFO L225 Difference]: With dead ends: 69 [2018-01-24 23:15:08,333 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 23:15:08,334 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=74, Invalid=119, Unknown=5, NotChecked=108, Total=306 [2018-01-24 23:15:08,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 23:15:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2018-01-24 23:15:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 23:15:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-01-24 23:15:08,343 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 25 [2018-01-24 23:15:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:15:08,344 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-01-24 23:15:08,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:15:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-01-24 23:15:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 23:15:08,345 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:15:08,345 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:15:08,345 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:15:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash -89010580, now seen corresponding path program 1 times [2018-01-24 23:15:08,346 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:15:08,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:15:08,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:15:08,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:15:08,347 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:15:08,353 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 23:15:08,353 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 23:15:08,353 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 23:15:08,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:15:08,373 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 23:15:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:15:08,414 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 23:15:08,414 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [17], [19], [20], [21], [22], [30], [34], [37], [39], [40], [43], [45], [49], [53], [58], [61], [78], [79], [80] [2018-01-24 23:15:08,416 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:15:08,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:15:10,733 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:15:10,734 INFO L268 AbstractInterpreter]: Visited 24 different actions 34 times. Merged at 10 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-24 23:15:10,735 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:15:10,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:15:10,736 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:15:10,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:15:10,746 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:15:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:15:10,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:15:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:15:10,819 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:15:10,991 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 64 DAG size of output 38 [2018-01-24 23:15:11,110 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-01-24 23:15:11,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:15:11,194 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-01-24 23:15:11,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:15:11,197 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-24 23:15:11,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:15:11,236 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-01-24 23:15:11,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 23:15:11,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:15:11,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:272, output treesize:37 Received shutdown request... [2018-01-24 23:15:17,767 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 23:15:17,768 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:15:17,770 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:15:17,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:15:17 BoogieIcfgContainer [2018-01-24 23:15:17,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:15:17,771 INFO L168 Benchmark]: Toolchain (without parser) took 60741.55 ms. Allocated memory was 311.4 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 268.2 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 167.4 MB. Max. memory is 5.3 GB. [2018-01-24 23:15:17,772 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 311.4 MB. Free memory is still 274.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:15:17,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.50 ms. Allocated memory is still 311.4 MB. Free memory was 268.2 MB in the beginning and 258.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:15:17,772 INFO L168 Benchmark]: Boogie Preprocessor took 38.76 ms. Allocated memory is still 311.4 MB. Free memory was 258.1 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:15:17,773 INFO L168 Benchmark]: RCFGBuilder took 267.99 ms. Allocated memory is still 311.4 MB. Free memory was 256.1 MB in the beginning and 239.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:15:17,773 INFO L168 Benchmark]: TraceAbstraction took 60189.96 ms. Allocated memory was 311.4 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 239.1 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 138.4 MB. Max. memory is 5.3 GB. [2018-01-24 23:15:17,775 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 311.4 MB. Free memory is still 274.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.50 ms. Allocated memory is still 311.4 MB. Free memory was 268.2 MB in the beginning and 258.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.76 ms. Allocated memory is still 311.4 MB. Free memory was 258.1 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 267.99 ms. Allocated memory is still 311.4 MB. Free memory was 256.1 MB in the beginning and 239.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60189.96 ms. Allocated memory was 311.4 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 239.1 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 138.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 222 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 8.909461 RENAME_VARIABLES(MILLISECONDS) : 4.719693 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 8.780497 PROJECTAWAY(MILLISECONDS) : 622.072290 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.100544 DISJOIN(MILLISECONDS) : 3.568884 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 4.789824 ADD_EQUALITY(MILLISECONDS) : 0.050672 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009380 #CONJOIN_DISJUNCTIVE : 46 #RENAME_VARIABLES : 73 #UNFREEZE : 0 #CONJOIN : 84 #PROJECTAWAY : 64 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 67 #ADD_EQUALITY : 39 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 235 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 42 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 6.365279 RENAME_VARIABLES(MILLISECONDS) : 3.676641 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 6.300402 PROJECTAWAY(MILLISECONDS) : 551.091360 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.053356 DISJOIN(MILLISECONDS) : 2.026404 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 3.728288 ADD_EQUALITY(MILLISECONDS) : 0.041523 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008526 #CONJOIN_DISJUNCTIVE : 46 #RENAME_VARIABLES : 73 #UNFREEZE : 0 #CONJOIN : 84 #PROJECTAWAY : 64 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 67 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 307 LocStat_NO_SUPPORTING_DISEQUALITIES : 52 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 9.104993 RENAME_VARIABLES(MILLISECONDS) : 2.382076 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.531863 PROJECTAWAY(MILLISECONDS) : 0.201032 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.089056 DISJOIN(MILLISECONDS) : 1.962284 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.414039 ADD_EQUALITY(MILLISECONDS) : 0.015599 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004068 #CONJOIN_DISJUNCTIVE : 58 #RENAME_VARIABLES : 97 #UNFREEZE : 0 #CONJOIN : 96 #PROJECTAWAY : 80 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 91 #ADD_EQUALITY : 41 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 338 LocStat_NO_SUPPORTING_DISEQUALITIES : 52 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 44 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 16.391289 RENAME_VARIABLES(MILLISECONDS) : 2.726350 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 8.338901 PROJECTAWAY(MILLISECONDS) : 0.190198 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.043784 DISJOIN(MILLISECONDS) : 2.064270 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.780627 ADD_EQUALITY(MILLISECONDS) : 0.014267 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006651 #CONJOIN_DISJUNCTIVE : 58 #RENAME_VARIABLES : 97 #UNFREEZE : 0 #CONJOIN : 96 #PROJECTAWAY : 80 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 91 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 540]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 46 locations, 7 error locations. TIMEOUT Result, 60.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 165 SDtfs, 488 SDslu, 333 SDs, 0 SdLazy, 348 SolverSat, 38 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 190 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 20.8s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 31 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 232 ConstructedInterpolants, 44 QuantifiedInterpolants, 106027 SizeOfPredicates, 32 NumberOfNonLiveVariables, 462 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 10/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-15-17-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_23-15-17-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_23-15-17-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_23-15-17-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_23-15-17-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_23-15-17-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_23-15-17-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_23-15-17-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_23-15-17-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-15-17-788.csv Completed graceful shutdown