java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:40:56,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:40:56,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:40:56,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:40:57,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:40:57,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:40:57,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:40:57,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:40:57,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:40:57,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:40:57,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:40:57,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:40:57,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:40:57,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:40:57,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:40:57,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:40:57,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:40:57,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:40:57,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:40:57,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:40:57,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:40:57,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:40:57,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:40:57,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:40:57,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:40:57,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:40:57,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:40:57,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:40:57,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:40:57,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:40:57,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:40:57,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:40:57,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:40:57,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:40:57,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:40:57,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:40:57,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:40:57,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:40:57,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:40:57,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:40:57,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:40:57,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 11:40:57,073 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:40:57,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:40:57,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:40:57,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:40:57,075 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:40:57,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:40:57,076 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:40:57,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:40:57,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:40:57,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:40:57,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:40:57,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:40:57,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:40:57,079 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:40:57,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:40:57,079 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:40:57,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:40:57,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:40:57,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:40:57,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:40:57,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:40:57,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:40:57,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:40:57,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:40:57,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:40:57,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:40:57,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:40:57,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:40:57,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:40:57,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:40:57,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:40:57,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:40:57,151 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:40:57,151 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:40:57,152 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c [2019-09-07 11:40:57,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa89d6f9b/a0718e66829b4f69a1a3cb7dbdf3cc0f/FLAG0b77a81ac [2019-09-07 11:40:57,696 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:40:57,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c [2019-09-07 11:40:57,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa89d6f9b/a0718e66829b4f69a1a3cb7dbdf3cc0f/FLAG0b77a81ac [2019-09-07 11:40:58,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa89d6f9b/a0718e66829b4f69a1a3cb7dbdf3cc0f [2019-09-07 11:40:58,087 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:40:58,088 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:40:58,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:40:58,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:40:58,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:40:58,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:40:58" (1/1) ... [2019-09-07 11:40:58,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ea11ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:40:58, skipping insertion in model container [2019-09-07 11:40:58,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:40:58" (1/1) ... [2019-09-07 11:40:58,105 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:40:58,122 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:40:58,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:40:58,317 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:40:58,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:40:58,444 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:40:58,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:40:58 WrapperNode [2019-09-07 11:40:58,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:40:58,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:40:58,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:40:58,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:40:58,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:40:58" (1/1) ... [2019-09-07 11:40:58,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:40:58" (1/1) ... [2019-09-07 11:40:58,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:40:58" (1/1) ... [2019-09-07 11:40:58,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:40:58" (1/1) ... [2019-09-07 11:40:58,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:40:58" (1/1) ... [2019-09-07 11:40:58,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:40:58" (1/1) ... [2019-09-07 11:40:58,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:40:58" (1/1) ... [2019-09-07 11:40:58,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:40:58,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:40:58,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:40:58,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:40:58,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:40:58" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-07 11:40:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:40:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:40:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 11:40:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:40:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:40:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-07 11:40:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 11:40:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:40:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-07 11:40:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:40:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-07 11:40:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:40:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:40:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:40:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:40:58,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:40:58,923 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:40:58,923 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-07 11:40:58,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:40:58 BoogieIcfgContainer [2019-09-07 11:40:58,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:40:58,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:40:58,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:40:58,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:40:58,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:40:58" (1/3) ... [2019-09-07 11:40:58,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e622ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:40:58, skipping insertion in model container [2019-09-07 11:40:58,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:40:58" (2/3) ... [2019-09-07 11:40:58,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e622ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:40:58, skipping insertion in model container [2019-09-07 11:40:58,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:40:58" (3/3) ... [2019-09-07 11:40:58,932 INFO L109 eAbstractionObserver]: Analyzing ICFG revcpyswp2.c [2019-09-07 11:40:58,943 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:40:58,950 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:40:58,967 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:40:58,997 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:40:58,998 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:40:58,999 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:40:58,999 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:40:58,999 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:40:58,999 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:40:58,999 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:40:58,999 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:40:58,999 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:40:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-09-07 11:40:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 11:40:59,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:59,026 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:59,028 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:59,033 INFO L82 PathProgramCache]: Analyzing trace with hash -285010775, now seen corresponding path program 1 times [2019-09-07 11:40:59,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:59,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:59,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:59,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:40:59,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:40:59,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:40:59,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:40:59,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:40:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:40:59,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:40:59,202 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-09-07 11:40:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:59,229 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2019-09-07 11:40:59,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:40:59,231 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-09-07 11:40:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:59,240 INFO L225 Difference]: With dead ends: 59 [2019-09-07 11:40:59,240 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 11:40:59,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:40:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 11:40:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-07 11:40:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 11:40:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-07 11:40:59,288 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2019-09-07 11:40:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:59,290 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-07 11:40:59,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:40:59,290 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-07 11:40:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 11:40:59,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:59,293 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:59,294 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1627005719, now seen corresponding path program 1 times [2019-09-07 11:40:59,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:59,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:59,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:59,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:40:59,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:40:59,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:40:59,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:40:59,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:40:59,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:40:59,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:40:59,464 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2019-09-07 11:40:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:59,550 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-09-07 11:40:59,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:40:59,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 11:40:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:59,552 INFO L225 Difference]: With dead ends: 51 [2019-09-07 11:40:59,552 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 11:40:59,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:40:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 11:40:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-07 11:40:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 11:40:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-07 11:40:59,562 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-09-07 11:40:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:59,562 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-07 11:40:59,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:40:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-07 11:40:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 11:40:59,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:59,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:59,564 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:59,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:59,565 INFO L82 PathProgramCache]: Analyzing trace with hash -381446827, now seen corresponding path program 1 times [2019-09-07 11:40:59,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:59,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:59,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:59,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:40:59,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 11:40:59,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:40:59,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 11:40:59,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:40:59,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:40:59,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:40:59,668 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-09-07 11:40:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:40:59,767 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-09-07 11:40:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:40:59,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-07 11:40:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:40:59,770 INFO L225 Difference]: With dead ends: 58 [2019-09-07 11:40:59,771 INFO L226 Difference]: Without dead ends: 41 [2019-09-07 11:40:59,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:40:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-07 11:40:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2019-09-07 11:40:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-07 11:40:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-07 11:40:59,783 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-09-07 11:40:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:40:59,784 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-07 11:40:59,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:40:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-07 11:40:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 11:40:59,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:40:59,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:40:59,786 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:40:59,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:40:59,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1677394545, now seen corresponding path program 1 times [2019-09-07 11:40:59,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:40:59,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:40:59,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:59,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:40:59,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:40:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:40:59,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:40:59,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:40:59,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:40:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:40:59,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:40:59,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:41:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 11:41:00,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:41:00,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-07 11:41:00,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:41:00,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:41:00,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:41:00,019 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-09-07 11:41:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:41:00,140 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-07 11:41:00,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:41:00,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-07 11:41:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:41:00,141 INFO L225 Difference]: With dead ends: 59 [2019-09-07 11:41:00,141 INFO L226 Difference]: Without dead ends: 36 [2019-09-07 11:41:00,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:41:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-07 11:41:00,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-07 11:41:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-07 11:41:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-07 11:41:00,149 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2019-09-07 11:41:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:41:00,150 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-07 11:41:00,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:41:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-07 11:41:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 11:41:00,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:00,151 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:00,152 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:00,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:00,152 INFO L82 PathProgramCache]: Analyzing trace with hash 760173005, now seen corresponding path program 2 times [2019-09-07 11:41:00,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:00,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:00,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:00,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:41:00,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 11:41:00,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:41:00,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 11:41:00,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:41:00,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:41:00,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:41:00,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:41:00,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:41:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 11:41:00,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:41:00,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-07 11:41:00,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:41:00,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:41:00,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:41:00,356 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2019-09-07 11:41:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:41:00,501 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-09-07 11:41:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:41:00,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-07 11:41:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:41:00,503 INFO L225 Difference]: With dead ends: 72 [2019-09-07 11:41:00,503 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 11:41:00,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:41:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 11:41:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2019-09-07 11:41:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 11:41:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-07 11:41:00,512 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 30 [2019-09-07 11:41:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:41:00,513 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-07 11:41:00,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:41:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-07 11:41:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 11:41:00,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:41:00,514 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:41:00,514 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:41:00,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:41:00,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1484472327, now seen corresponding path program 3 times [2019-09-07 11:41:00,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:41:00,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:41:00,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:00,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:41:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:41:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:41:01,119 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2019-09-07 11:41:01,564 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2019-09-07 11:41:01,750 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 43 [2019-09-07 11:41:01,904 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2019-09-07 11:41:02,037 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2019-09-07 11:41:02,181 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 43 [2019-09-07 11:41:02,344 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 39 [2019-09-07 11:41:02,524 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-07 11:41:02,694 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-07 11:41:02,838 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-07 11:41:03,174 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-09-07 11:41:03,346 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-09-07 11:41:03,549 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-07 11:41:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:41:03,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:41:03,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:41:03,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:41:04,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:41:04,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:41:04,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-07 11:41:04,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:41:04,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:04,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-09-07 11:41:04,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:04,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:04,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:04,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:40 [2019-09-07 11:41:04,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2019-09-07 11:41:04,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:04,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:04,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:04,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:40 [2019-09-07 11:41:04,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:04,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 53 [2019-09-07 11:41:04,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:04,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:04,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:04,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:142, output treesize:89 [2019-09-07 11:41:04,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:04,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:04,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:04,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:04,811 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:04,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 118 [2019-09-07 11:41:04,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:04,898 INFO L567 ElimStorePlain]: treesize reduction 38, result has 76.1 percent of original size [2019-09-07 11:41:04,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-07 11:41:04,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:174, output treesize:121 [2019-09-07 11:41:05,164 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:41:05,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:05,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:05,167 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:41:05,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:05,179 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:05,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 8 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 132 [2019-09-07 11:41:05,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:05,271 INFO L567 ElimStorePlain]: treesize reduction 42, result has 75.9 percent of original size [2019-09-07 11:41:05,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-07 11:41:05,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:187, output treesize:132 [2019-09-07 11:41:05,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:05,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:05,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:05,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:05,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:05,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:05,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 220 [2019-09-07 11:41:05,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:05,703 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-07 11:41:05,704 INFO L567 ElimStorePlain]: treesize reduction 92, result has 66.4 percent of original size [2019-09-07 11:41:05,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:05,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-07 11:41:05,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:166, output treesize:173 [2019-09-07 11:41:05,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:05,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:05,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:05,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:05,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:05,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:05,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:05,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,910 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-07 11:41:06,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:06,923 INFO L392 ElimStorePlain]: Different costs {54=[|v_#memory_int_21|], 88=[v_prenex_5]} [2019-09-07 11:41:06,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:06,946 INFO L341 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2019-09-07 11:41:06,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 108 [2019-09-07 11:41:06,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:07,070 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-09-07 11:41:07,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:07,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:07,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:07,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:07,097 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:07,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 172 [2019-09-07 11:41:07,099 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:07,289 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-07 11:41:07,289 INFO L567 ElimStorePlain]: treesize reduction 42, result has 82.6 percent of original size [2019-09-07 11:41:07,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-09-07 11:41:07,293 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:288, output treesize:186 [2019-09-07 11:41:07,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:07,527 INFO L392 ElimStorePlain]: Different costs {40=[|v_#memory_int_22|], 70=[v_prenex_8]} [2019-09-07 11:41:07,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:07,573 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:07,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 157 [2019-09-07 11:41:07,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:07,853 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-09-07 11:41:07,853 INFO L567 ElimStorePlain]: treesize reduction 52, result has 83.0 percent of original size [2019-09-07 11:41:07,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:07,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:41:07,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:07,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 155 treesize of output 242 [2019-09-07 11:41:07,918 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:08,164 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-07 11:41:08,165 INFO L567 ElimStorePlain]: treesize reduction 74, result has 78.7 percent of original size [2019-09-07 11:41:08,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-09-07 11:41:08,174 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:276, output treesize:244 [2019-09-07 11:41:08,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:08,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:41:09,511 WARN L188 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2019-09-07 11:41:09,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 11:41:09,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2019-09-07 11:41:09,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:41:09,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:41:09,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:41:09,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:3 [2019-09-07 11:41:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:41:10,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:41:10,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 47 [2019-09-07 11:41:10,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 11:41:10,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 11:41:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1864, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 11:41:10,011 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 47 states. [2019-09-07 11:41:10,454 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-09-07 11:41:10,777 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 51 [2019-09-07 11:41:13,068 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-09-07 11:41:13,451 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 76 [2019-09-07 11:41:15,887 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-09-07 11:41:16,558 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 68 [2019-09-07 11:41:19,418 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-07 11:41:19,727 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 74 [2019-09-07 11:41:19,973 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2019-09-07 11:41:22,544 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 103 [2019-09-07 11:41:27,092 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 78 [2019-09-07 11:41:27,332 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2019-09-07 11:41:27,635 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 49 [2019-09-07 11:41:28,870 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 77 [2019-09-07 11:41:29,185 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 85 [2019-09-07 11:41:29,554 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 47 [2019-09-07 11:41:29,728 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-09-07 11:41:34,600 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 54 [2019-09-07 11:41:37,608 WARN L188 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 153 DAG size of output: 89 [2019-09-07 11:41:37,790 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-09-07 11:41:37,976 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-07 11:41:38,363 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2019-09-07 11:41:38,746 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 54 [2019-09-07 11:41:53,075 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 143 DAG size of output: 62 [2019-09-07 11:41:53,475 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 65 [2019-09-07 11:42:04,250 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 55 [2019-09-07 11:42:04,983 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-07 11:42:05,336 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 59 [2019-09-07 11:42:07,753 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 59 [2019-09-07 11:42:10,238 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 48 [2019-09-07 11:42:10,449 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 43 [2019-09-07 11:42:10,968 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 56 [2019-09-07 11:42:11,737 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 47 [2019-09-07 11:42:16,108 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2019-09-07 11:42:20,333 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 50 [2019-09-07 11:42:20,604 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-09-07 11:42:22,924 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 48 [2019-09-07 11:42:25,122 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-09-07 11:42:41,947 WARN L188 SmtUtils]: Spent 6.13 s on a formula simplification. DAG size of input: 164 DAG size of output: 67 [2019-09-07 11:42:50,753 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2019-09-07 11:42:51,147 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-09-07 11:42:51,406 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 42 [2019-09-07 11:42:51,604 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 43 [2019-09-07 11:42:51,941 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 42 [2019-09-07 11:42:52,141 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 43 [2019-09-07 11:42:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:42:52,183 INFO L93 Difference]: Finished difference Result 217 states and 260 transitions. [2019-09-07 11:42:52,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-07 11:42:52,183 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 36 [2019-09-07 11:42:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:42:52,188 INFO L225 Difference]: With dead ends: 217 [2019-09-07 11:42:52,188 INFO L226 Difference]: Without dead ends: 215 [2019-09-07 11:42:52,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3544 ImplicationChecksByTransitivity, 77.7s TimeCoverageRelationStatistics Valid=2063, Invalid=8629, Unknown=20, NotChecked=0, Total=10712 [2019-09-07 11:42:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-07 11:42:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 100. [2019-09-07 11:42:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-07 11:42:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2019-09-07 11:42:52,220 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 36 [2019-09-07 11:42:52,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:42:52,220 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2019-09-07 11:42:52,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 11:42:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2019-09-07 11:42:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 11:42:52,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:42:52,222 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:42:52,222 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:42:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:42:52,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1556379205, now seen corresponding path program 4 times [2019-09-07 11:42:52,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:42:52,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:42:52,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:52,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:42:52,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:42:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:42:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 11:42:52,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:42:52,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-09-07 11:42:52,315 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:42:52,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:42:52,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:42:52,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 11:42:52,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:42:52,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:52,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-09-07 11:42:52,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:42:52,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:42:52,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:42:52,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2019-09-07 11:42:52,595 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-07 11:42:52,595 INFO L341 Elim1Store]: treesize reduction 38, result has 88.1 percent of original size [2019-09-07 11:42:52,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 403 [2019-09-07 11:42:52,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 11:42:52,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:52,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:42:52,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:42:53,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:42:53,092 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:146) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-07 11:42:53,100 INFO L168 Benchmark]: Toolchain (without parser) took 115009.51 ms. Allocated memory was 135.3 MB in the beginning and 345.5 MB in the end (delta: 210.2 MB). Free memory was 89.7 MB in the beginning and 217.2 MB in the end (delta: -127.5 MB). Peak memory consumption was 236.8 MB. Max. memory is 7.1 GB. [2019-09-07 11:42:53,101 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 135.3 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 11:42:53,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.77 ms. Allocated memory was 135.3 MB in the beginning and 201.9 MB in the end (delta: 66.6 MB). Free memory was 89.5 MB in the beginning and 178.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-09-07 11:42:53,104 INFO L168 Benchmark]: Boogie Preprocessor took 47.50 ms. Allocated memory is still 201.9 MB. Free memory was 178.7 MB in the beginning and 176.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-07 11:42:53,110 INFO L168 Benchmark]: RCFGBuilder took 431.55 ms. Allocated memory is still 201.9 MB. Free memory was 176.3 MB in the beginning and 158.4 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2019-09-07 11:42:53,111 INFO L168 Benchmark]: TraceAbstraction took 114170.94 ms. Allocated memory was 201.9 MB in the beginning and 345.5 MB in the end (delta: 143.7 MB). Free memory was 157.8 MB in the beginning and 217.2 MB in the end (delta: -59.4 MB). Peak memory consumption was 238.3 MB. Max. memory is 7.1 GB. [2019-09-07 11:42:53,120 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 135.3 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 355.77 ms. Allocated memory was 135.3 MB in the beginning and 201.9 MB in the end (delta: 66.6 MB). Free memory was 89.5 MB in the beginning and 178.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.50 ms. Allocated memory is still 201.9 MB. Free memory was 178.7 MB in the beginning and 176.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 431.55 ms. Allocated memory is still 201.9 MB. Free memory was 176.3 MB in the beginning and 158.4 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114170.94 ms. Allocated memory was 201.9 MB in the beginning and 345.5 MB in the end (delta: 143.7 MB). Free memory was 157.8 MB in the beginning and 217.2 MB in the end (delta: -59.4 MB). Peak memory consumption was 238.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...